On reductions to sets that avoid EXPSPACE
Identifieur interne : 002902 ( Main/Exploration ); précédent : 002901; suivant : 002903On reductions to sets that avoid EXPSPACE
Auteurs : V. Arvind [Inde] ; J. Köbler [Allemagne] ; M. Mundhenk [Allemagne]Source :
- 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
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000989
- to stream Istex, to step Curation: 000936
- to stream Istex, to step Checkpoint: 001099
- to stream Main, to step Merge: 002E04
- to stream Main, to step Curation: 002902
Le 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></author><author><name sortKey="Kobler, J" sort="Kobler, J" uniqKey="Kobler J" first="J." last="Köbler">J. Köbler</name></author><author><name sortKey="Mundhenk, M" sort="Mundhenk, M" uniqKey="Mundhenk M" first="M." last="Mundhenk">M. Mundhenk</name></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><idno type="wicri:Area/Istex/Curation">000936</idno><idno type="wicri:Area/Istex/Checkpoint">001099</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001099</idno><idno type="wicri:doubleKey">0020-0190:1995:Arvind V:on:reductions:to</idno><idno type="wicri:Area/Main/Merge">002E04</idno><idno type="wicri:Area/Main/Curation">002902</idno><idno type="wicri:Area/Main/Exploration">002902</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 wicri:level="1"><country xml:lang="fr">Inde</country><wicri:regionArea>Institute of Mathematical Sciences, C.I.T. Campus, Madras 600113</wicri:regionArea><wicri:noRegion>Madras 600113</wicri:noRegion></affiliation><affiliation></affiliation></author><author><name sortKey="Kobler, J" sort="Kobler, J" uniqKey="Kobler J" first="J." last="Köbler">J. Köbler</name><affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Abteilung Theoretische Informatik, Universität Ulm, D-89069 Ulm</wicri:regionArea><placeName><region type="land" nuts="1">Bade-Wurtemberg</region><region type="district" nuts="2">District de Tübingen</region><settlement type="city">Ulm</settlement></placeName><orgName type="university">Université d'Ulm</orgName></affiliation></author><author><name sortKey="Mundhenk, M" sort="Mundhenk, M" uniqKey="Mundhenk M" first="M." last="Mundhenk">M. Mundhenk</name><affiliation></affiliation><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>FB IV — Informatik, Universität Trier, D-54286 Trier</wicri:regionArea><wicri:noRegion>54286 Trier</wicri:noRegion><wicri:noRegion>D-54286 Trier</wicri:noRegion></affiliation><affiliation></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></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><affiliations><list><country><li>Allemagne</li><li>Inde</li></country><region><li>Bade-Wurtemberg</li><li>District de Tübingen</li></region><settlement><li>Ulm</li></settlement><orgName><li>Université d'Ulm</li></orgName></list><tree><country name="Inde"><noRegion><name sortKey="Arvind, V" sort="Arvind, V" uniqKey="Arvind V" first="V." last="Arvind">V. Arvind</name></noRegion></country><country name="Allemagne"><region name="Bade-Wurtemberg"><name sortKey="Kobler, J" sort="Kobler, J" uniqKey="Kobler J" first="J." last="Köbler">J. Köbler</name></region><name sortKey="Mundhenk, M" sort="Mundhenk, M" uniqKey="Mundhenk M" first="M." last="Mundhenk">M. Mundhenk</name><name sortKey="Mundhenk, M" sort="Mundhenk, M" uniqKey="Mundhenk M" first="M." last="Mundhenk">M. Mundhenk</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002902 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002902 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:C51014CBB7347B9EE6D33D5E45A9F48F3F5C7F25
|texte= On reductions to sets that avoid EXPSPACE
}}
| This area was generated with Dilib version V0.6.31. |  |