On reductions to sets that avoid EXPSPACE
Identifieur interne : 000989 ( Istex/Corpus ); précédent : 000988; suivant : 000990On reductions to sets that avoid EXPSPACE
Auteurs : V. Arvind ; J. Köbler ; M. MundhenkSource :
- Information Processing Letters [ 0020-0190 ] ; 1995.
Abstract
A set B is called EXPSPACE-avoiding, if every subset of B in EXPSPACE is sparse. For example, sets of high information density (called HIGH sets in [5]) are shown to be EXPSPACE-avoiding. Investigating the complexity of sets A in EXPSPACE that honestly reduce to EXPSPACE-avoiding sets, we show that if the reducibility used has a property, called range-constructibility, then A must also reduce to a sparse set under the same reducibility.
Url:
DOI: 10.1016/0020-0190(95)00138-3
Links to Exploration step
ISTEX:C51014CBB7347B9EE6D33D5E45A9F48F3F5C7F25Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>On reductions to sets that avoid EXPSPACE</title><author><name sortKey="Arvind, V" sort="Arvind, V" uniqKey="Arvind V" first="V." last="Arvind">V. Arvind</name><affiliation><mods:affiliation>Institute of Mathematical Sciences, C.I.T. Campus, Madras 600113, India</mods:affiliation></affiliation><affiliation><mods:affiliation>2 Work done at Universität Ulm. Supported in part by an Alexander von Humboldt research fellowship.</mods:affiliation></affiliation></author><author><name sortKey="Kobler, J" sort="Kobler, J" uniqKey="Kobler J" first="J." last="Köbler">J. Köbler</name><affiliation><mods:affiliation>Abteilung Theoretische Informatik, Universität Ulm, D-89069 Ulm, Germany</mods:affiliation></affiliation></author><author><name sortKey="Mundhenk, M" sort="Mundhenk, M" uniqKey="Mundhenk M" first="M." last="Mundhenk">M. Mundhenk</name><affiliation><mods:affiliation>Corresponding author.</mods:affiliation></affiliation><affiliation><mods:affiliation>FB IV — Informatik, Universität Trier, D-54286 Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>∗ Work supported in part by the DAAD through Acciones Integradas 1992, 313-AI-e-es/zk.</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: mundhenk@ti.uni-trier.de</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:C51014CBB7347B9EE6D33D5E45A9F48F3F5C7F25</idno><date when="1995" year="1995">1995</date><idno type="doi">10.1016/0020-0190(95)00138-3</idno><idno type="url">https://api.istex.fr/document/C51014CBB7347B9EE6D33D5E45A9F48F3F5C7F25/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000989</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000989</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">On reductions to sets that avoid EXPSPACE</title><author><name sortKey="Arvind, V" sort="Arvind, V" uniqKey="Arvind V" first="V." last="Arvind">V. Arvind</name><affiliation><mods:affiliation>Institute of Mathematical Sciences, C.I.T. Campus, Madras 600113, India</mods:affiliation></affiliation><affiliation><mods:affiliation>2 Work done at Universität Ulm. Supported in part by an Alexander von Humboldt research fellowship.</mods:affiliation></affiliation></author><author><name sortKey="Kobler, J" sort="Kobler, J" uniqKey="Kobler J" first="J." last="Köbler">J. Köbler</name><affiliation><mods:affiliation>Abteilung Theoretische Informatik, Universität Ulm, D-89069 Ulm, Germany</mods:affiliation></affiliation></author><author><name sortKey="Mundhenk, M" sort="Mundhenk, M" uniqKey="Mundhenk M" first="M." last="Mundhenk">M. Mundhenk</name><affiliation><mods:affiliation>Corresponding author.</mods:affiliation></affiliation><affiliation><mods:affiliation>FB IV — Informatik, Universität Trier, D-54286 Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>∗ Work supported in part by the DAAD through Acciones Integradas 1992, 313-AI-e-es/zk.</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: mundhenk@ti.uni-trier.de</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="j">Information Processing Letters</title><title level="j" type="abbrev">IPL</title><idno type="ISSN">0020-0190</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1995">1995</date><biblScope unit="volume">56</biblScope><biblScope unit="issue">2</biblScope><biblScope unit="page" from="109">109</biblScope><biblScope unit="page" to="114">114</biblScope></imprint><idno type="ISSN">0020-0190</idno></series><idno type="istex">C51014CBB7347B9EE6D33D5E45A9F48F3F5C7F25</idno><idno type="DOI">10.1016/0020-0190(95)00138-3</idno><idno type="PII">0020-0190(95)00138-3</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0020-0190</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">A set B is called EXPSPACE-avoiding, if every subset of B in EXPSPACE is sparse. For example, sets of high information density (called HIGH sets in [5]) are shown to be EXPSPACE-avoiding. Investigating the complexity of sets A in EXPSPACE that honestly reduce to EXPSPACE-avoiding sets, we show that if the reducibility used has a property, called range-constructibility, then A must also reduce to a sparse set under the same reducibility.</div></front></TEI><istex><corpusName>elsevier</corpusName><author><json:item><name>V. Arvind</name><affiliations><json:string>Institute of Mathematical Sciences, C.I.T. Campus, Madras 600113, India</json:string><json:string>2 Work done at Universität Ulm. Supported in part by an Alexander von Humboldt research fellowship.</json:string></affiliations></json:item><json:item><name>J. Köbler</name><affiliations><json:string>Abteilung Theoretische Informatik, Universität Ulm, D-89069 Ulm, Germany</json:string></affiliations></json:item><json:item><name>M. Mundhenk</name><affiliations><json:string>Corresponding author.</json:string><json:string>FB IV — Informatik, Universität Trier, D-54286 Trier, Germany</json:string><json:string>∗ Work supported in part by the DAAD through Acciones Integradas 1992, 313-AI-e-es/zk.</json:string><json:string>E-mail: mundhenk@ti.uni-trier.de</json:string></affiliations></json:item></author><subject><json:item><lang><json:string>eng</json:string></lang><value>Computational complexity</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Reducibilities</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Sparse sets</value></json:item></subject><language><json:string>eng</json:string></language><originalGenre><json:string>Full-length article</json:string></originalGenre><abstract>A set B is called EXPSPACE-avoiding, if every subset of B in EXPSPACE is sparse. For example, sets of high information density (called HIGH sets in [5]) are shown to be EXPSPACE-avoiding. Investigating the complexity of sets A in EXPSPACE that honestly reduce to EXPSPACE-avoiding sets, we show that if the reducibility used has a property, called range-constructibility, then A must also reduce to a sparse set under the same reducibility.</abstract><qualityIndicators><score>3.982</score><pdfVersion>1.2</pdfVersion><pdfPageSize>540 x 684 pts</pdfPageSize><refBibsNative>true</refBibsNative><keywordCount>3</keywordCount><abstractCharCount>440</abstractCharCount><pdfWordCount>3130</pdfWordCount><pdfCharCount>16178</pdfCharCount><pdfPageCount>6</pdfPageCount><abstractWordCount>71</abstractWordCount></qualityIndicators><title>On reductions to sets that avoid EXPSPACE</title><pii><json:string>0020-0190(95)00138-3</json:string></pii><refBibs><json:item><author><json:item><name>L. Adleman</name></json:item><json:item><name>K. Manders</name></json:item></author><host><pages><last>163</last><first>151</first></pages><author></author><title>Proc. 9th ACM Symp. on Theory of Computing</title></host><title>Reducibility, randomness and intractability</title></json:item><json:item><host><author></author></host></json:item><json:item><host><author></author></host></json:item><json:item><author><json:item><name>J.L. Balcázar</name></json:item><json:item><name>J. Díaz</name></json:item><json:item><name>J. Gabarró</name></json:item></author><host><author></author><title>EATCS Monographs on Theoretical Computer Science</title></host><serie><author></author><title>EATCS Monographs on Theoretical Computer Science</title></serie><title>Structural Complexity I/II</title></json:item><json:item><author><json:item><name>R. Book</name></json:item><json:item><name>J. Lutz</name></json:item></author><host><volume>22</volume><pages><last>402</last><first>395</first></pages><author></author><title>SIAM J. Comput.</title></host><title>On languages with very high spacebounded Kolmogorov complexity</title></json:item><json:item><author><json:item><name>R. Book</name></json:item><json:item><name>U. Schöning</name></json:item></author><host><volume>13</volume><pages><last>337</last><first>329</first></pages><author></author><title>SIAM J. Comput.</title></host><title>Immunity, relativizations and nondeterminism</title></json:item><json:item><author><json:item><name>H. Buhrman</name></json:item><json:item><name>L. Longpré</name></json:item><json:item><name>E. Spaan</name></json:item></author><host><pages><last>214</last><first>208</first></pages><author></author><title>Proc. 8th Structure in Complexity Theory Conf.</title></host><title>SPARSE reduces conjunctively to TALLY</title></json:item><json:item><author><json:item><name>R. Karp</name></json:item><json:item><name>R. Lipton</name></json:item></author><host><pages><last>309</last><first>302</first></pages><author></author><title>Proc. 12th ACM Symp. on Theory of Computing</title></host><title>Some connections between nonuniform and uniform complexity classes</title></json:item><json:item><author><json:item><name>R. Ladner</name></json:item><json:item><name>N. Lynch</name></json:item><json:item><name>A. Selman</name></json:item></author><host><volume>1</volume><pages><last>124</last><first>103</first></pages><author></author><title>Theoret. Comput. Sci.</title></host><title>A comparison of polynomial time reducibilities</title></json:item><json:item><author><json:item><name>S. Mahaney</name></json:item></author><host><volume>25</volume><pages><last>143</last><first>130</first></pages><author></author><title>J. Comput. System Sci.</title></host><title>Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis</title></json:item><json:item><author><json:item><name>M. Ogiwara</name></json:item><json:item><name>O. Watanabe</name></json:item></author><host><volume>20</volume><pages><last>483</last><first>471</first></pages><author></author><title>SIAM J. Comput.</title></host><title>On polynomial-time bounded truth-table reducibility of NP sets to sparse sets</title></json:item><json:item><author><json:item><name>K.W. Wagner</name></json:item></author><host><volume>51</volume><pages><last>80</last><first>53</first></pages><author></author><title>Theoret. Comput. Sci.</title></host><title>More complicated questions about maxima and minima, and some closures of NP</title></json:item></refBibs><genre><json:string>research-article</json:string></genre><serie><language><json:string>unknown</json:string></language><title>EATCS Monographs on Theoretical Computer Science</title></serie><host><volume>56</volume><pii><json:string>S0020-0190(00)X0016-6</json:string></pii><pages><last>114</last><first>109</first></pages><issn><json:string>0020-0190</json:string></issn><issue>2</issue><genre><json:string>journal</json:string></genre><language><json:string>unknown</json:string></language><title>Information Processing Letters</title><publicationDate>1995</publicationDate></host><categories><wos><json:string>science</json:string><json:string>computer science, information systems</json:string></wos><scienceMetrix><json:string>applied sciences</json:string><json:string>information & communication technologies</json:string><json:string>computation theory & mathematics</json:string></scienceMetrix></categories><publicationDate>1995</publicationDate><copyrightDate>1995</copyrightDate><doi><json:string>10.1016/0020-0190(95)00138-3</json:string></doi><id>C51014CBB7347B9EE6D33D5E45A9F48F3F5C7F25</id><score>0.34783563</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/C51014CBB7347B9EE6D33D5E45A9F48F3F5C7F25/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/C51014CBB7347B9EE6D33D5E45A9F48F3F5C7F25/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/C51014CBB7347B9EE6D33D5E45A9F48F3F5C7F25/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a">On reductions to sets that avoid EXPSPACE</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>ELSEVIER</publisher><availability><p>ELSEVIER</p></availability><date>1995</date></publicationStmt><notesStmt><note>A preliminary version was presented at MFCS'93.</note><note>Communicated by T. Lengauer</note></notesStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a">On reductions to sets that avoid EXPSPACE</title><author xml:id="author-1"><persName><forename type="first">V.</forename><surname>Arvind</surname></persName><affiliation>Institute of Mathematical Sciences, C.I.T. Campus, Madras 600113, India</affiliation><affiliation>2 Work done at Universität Ulm. Supported in part by an Alexander von Humboldt research fellowship.</affiliation></author><author xml:id="author-2"><persName><forename type="first">J.</forename><surname>Köbler</surname></persName><affiliation>Abteilung Theoretische Informatik, Universität Ulm, D-89069 Ulm, Germany</affiliation></author><author xml:id="author-3"><persName><forename type="first">M.</forename><surname>Mundhenk</surname></persName><email>mundhenk@ti.uni-trier.de</email><affiliation>Corresponding author.</affiliation><affiliation>FB IV — Informatik, Universität Trier, D-54286 Trier, Germany</affiliation><affiliation>∗ Work supported in part by the DAAD through Acciones Integradas 1992, 313-AI-e-es/zk.</affiliation></author></analytic><monogr><title level="j">Information Processing Letters</title><title level="j" type="abbrev">IPL</title><idno type="pISSN">0020-0190</idno><idno type="PII">S0020-0190(00)X0016-6</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1995"></date><biblScope unit="volume">56</biblScope><biblScope unit="issue">2</biblScope><biblScope unit="page" from="109">109</biblScope><biblScope unit="page" to="114">114</biblScope></imprint></monogr><idno type="istex">C51014CBB7347B9EE6D33D5E45A9F48F3F5C7F25</idno><idno type="DOI">10.1016/0020-0190(95)00138-3</idno><idno type="PII">0020-0190(95)00138-3</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>1995</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>A set B is called EXPSPACE-avoiding, if every subset of B in EXPSPACE is sparse. For example, sets of high information density (called HIGH sets in [5]) are shown to be EXPSPACE-avoiding. Investigating the complexity of sets A in EXPSPACE that honestly reduce to EXPSPACE-avoiding sets, we show that if the reducibility used has a property, called range-constructibility, then A must also reduce to a sparse set under the same reducibility.</p></abstract><textClass><keywords scheme="keyword"><list><head>Keywords</head><item><term>Computational complexity</term></item><item><term>Reducibilities</term></item><item><term>Sparse sets</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="1995-08-01">Modified</change><change when="1995">Published</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/C51014CBB7347B9EE6D33D5E45A9F48F3F5C7F25/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Elsevier, elements deleted: tail"><istex:xmlDeclaration>version="1.0" encoding="utf-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//ES//DTD journal article DTD version 4.5.2//EN//XML" URI="art452.dtd" name="istex:docType"></istex:docType><istex:document><converted-article version="4.5.2" docsubtype="fla"><item-info><jid>IPL</jid><aid>95001383</aid><ce:pii>0020-0190(95)00138-3</ce:pii><ce:doi>10.1016/0020-0190(95)00138-3</ce:doi><ce:copyright type="unknown" year="1995"></ce:copyright></item-info><head><ce:article-footnote><ce:label>☆</ce:label><ce:note-para>A preliminary version was presented at MFCS'93.</ce:note-para></ce:article-footnote><ce:title>On reductions to sets that avoid EXPSPACE</ce:title><ce:author-group><ce:author><ce:given-name>V.</ce:given-name><ce:surname>Arvind</ce:surname><ce:cross-ref refid="AFF1"><ce:sup>a</ce:sup></ce:cross-ref><ce:cross-ref refid="FN2"><ce:sup>2</ce:sup></ce:cross-ref></ce:author><ce:author><ce:given-name>J.</ce:given-name><ce:surname>Köbler</ce:surname><ce:cross-ref refid="AFF2"><ce:sup>b</ce:sup></ce:cross-ref></ce:author><ce:author><ce:given-name>M.</ce:given-name><ce:surname>Mundhenk</ce:surname><ce:cross-ref refid="COR1"><ce:sup>∗</ce:sup></ce:cross-ref><ce:cross-ref refid="AFF3"><ce:sup>c</ce:sup></ce:cross-ref><ce:cross-ref refid="FN1"><ce:sup>∗</ce:sup></ce:cross-ref><ce:e-address>mundhenk@ti.uni-trier.de</ce:e-address></ce:author><ce:affiliation id="AFF1"><ce:label>a</ce:label><ce:textfn>Institute of Mathematical Sciences, C.I.T. Campus, Madras 600113, India</ce:textfn></ce:affiliation><ce:affiliation id="AFF2"><ce:label>b</ce:label><ce:textfn>Abteilung Theoretische Informatik, Universität Ulm, D-89069 Ulm, Germany</ce:textfn></ce:affiliation><ce:affiliation id="AFF3"><ce:label>c</ce:label><ce:textfn>FB IV — Informatik, Universität Trier, D-54286 Trier, Germany</ce:textfn></ce:affiliation><ce:correspondence id="COR1"><ce:label>∗</ce:label><ce:text>Corresponding author.</ce:text></ce:correspondence><ce:footnote id="FN2"><ce:label>2</ce:label><ce:note-para>Work done at Universität Ulm. Supported in part by an Alexander von Humboldt research fellowship.</ce:note-para></ce:footnote><ce:footnote id="FN1"><ce:label>∗</ce:label><ce:note-para>Work supported in part by the DAAD through Acciones Integradas 1992, 313-AI-e-es/zk.</ce:note-para></ce:footnote></ce:author-group><ce:date-received day="5" month="8" year="1994"></ce:date-received><ce:date-revised day="1" month="8" year="1995"></ce:date-revised><ce:miscellaneous>Communicated by T. Lengauer</ce:miscellaneous><ce:abstract><ce:section-title>Abstract</ce:section-title><ce:abstract-sec><ce:simple-para>A set <ce:italic>B</ce:italic> is called EXPSPACE-avoiding, if every subset of <ce:italic>B</ce:italic> in EXPSPACE is sparse. For example, sets of high information density (called <math altimg="si1.gif"><sc>HIGH</sc></math> sets in [5]) are shown to be EXPSPACE-avoiding. Investigating the complexity of sets <ce:italic>A</ce:italic> in EXPSPACE that honestly reduce to EXPSPACE-avoiding sets, we show that if the reducibility used has a property, called range-constructibility, then <ce:italic>A</ce:italic> must also reduce to a sparse set under the same reducibility.</ce:simple-para></ce:abstract-sec></ce:abstract><ce:keywords><ce:section-title>Keywords</ce:section-title><ce:keyword><ce:text>Computational complexity</ce:text></ce:keyword><ce:keyword><ce:text>Reducibilities</ce:text></ce:keyword><ce:keyword><ce:text>Sparse sets</ce:text></ce:keyword></ce:keywords></head></converted-article></istex:document></istex:metadataXml><mods version="3.6"><titleInfo><title>On reductions to sets that avoid EXPSPACE</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>On reductions to sets that avoid EXPSPACE</title></titleInfo><name type="personal"><namePart type="given">V.</namePart><namePart type="family">Arvind</namePart><affiliation>Institute of Mathematical Sciences, C.I.T. Campus, Madras 600113, India</affiliation><affiliation>2 Work done at Universität Ulm. Supported in part by an Alexander von Humboldt research fellowship.</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="family">Köbler</namePart><affiliation>Abteilung Theoretische Informatik, Universität Ulm, D-89069 Ulm, Germany</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">M.</namePart><namePart type="family">Mundhenk</namePart><affiliation>Corresponding author.</affiliation><affiliation>FB IV — Informatik, Universität Trier, D-54286 Trier, Germany</affiliation><affiliation>∗ Work supported in part by the DAAD through Acciones Integradas 1992, 313-AI-e-es/zk.</affiliation><affiliation>E-mail: mundhenk@ti.uni-trier.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="research-article" displayLabel="Full-length article"></genre><originInfo><publisher>ELSEVIER</publisher><dateIssued encoding="w3cdtf">1995</dateIssued><dateModified encoding="w3cdtf">1995-08-01</dateModified><copyrightDate encoding="w3cdtf">1995</copyrightDate></originInfo><language><languageTerm type="code" authority="iso639-2b">eng</languageTerm><languageTerm type="code" authority="rfc3066">en</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">A set B is called EXPSPACE-avoiding, if every subset of B in EXPSPACE is sparse. For example, sets of high information density (called HIGH sets in [5]) are shown to be EXPSPACE-avoiding. Investigating the complexity of sets A in EXPSPACE that honestly reduce to EXPSPACE-avoiding sets, we show that if the reducibility used has a property, called range-constructibility, then A must also reduce to a sparse set under the same reducibility.</abstract><note>A preliminary version was presented at MFCS'93.</note><note>Communicated by T. Lengauer</note><subject><genre>Keywords</genre><topic>Computational complexity</topic><topic>Reducibilities</topic><topic>Sparse sets</topic></subject><relatedItem type="host"><titleInfo><title>Information Processing Letters</title></titleInfo><titleInfo type="abbreviated"><title>IPL</title></titleInfo><genre type="journal">journal</genre><originInfo><dateIssued encoding="w3cdtf">19951027</dateIssued></originInfo><identifier type="ISSN">0020-0190</identifier><identifier type="PII">S0020-0190(00)X0016-6</identifier><part><date>19951027</date><detail type="volume"><number>56</number><caption>vol.</caption></detail><detail type="issue"><number>2</number><caption>no.</caption></detail><extent unit="issue pages"><start>67</start><end>121</end></extent><extent unit="pages"><start>109</start><end>114</end></extent></part></relatedItem><identifier type="istex">C51014CBB7347B9EE6D33D5E45A9F48F3F5C7F25</identifier><identifier type="DOI">10.1016/0020-0190(95)00138-3</identifier><identifier type="PII">0020-0190(95)00138-3</identifier><recordInfo><recordContentSource>ELSEVIER</recordContentSource></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000989 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000989 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:C51014CBB7347B9EE6D33D5E45A9F48F3F5C7F25
|texte= On reductions to sets that avoid EXPSPACE
}}
| This area was generated with Dilib version V0.6.31. |  |