Upper bounds for the complexity of sparse and tally descriptions
Identifieur interne : 001229 ( Istex/Curation ); précédent : 001228; suivant : 001230Upper bounds for the complexity of sparse and tally descriptions
Auteurs : V. Arvind [Inde] ; J. Köbler [Allemagne] ; M. Mundhenk [Allemagne]Source :
- Mathematical systems theory [ 0025-5661 ] ; 1996-02-01.
Abstract
Abstract: We investigate the complexity of computing small descriptions for sets in various reduction classes to sparse sets. For example, we show that if a setA and its complement conjunctively reduce to some sparse set, then they also are conjunctively reducible to a P(A ⊕ SAT)-printable tally set. As a consequence, the class IC[log,poly] of sets with low instance complexity is contained in theEL 1 Σ -level of the extended low hierarchy. By refining our techniques, we also show that all word-decreasing self-reducible sets in IC[log, poly] are in NP ∩ co-NP and therefore low for NP. We derive similar results for sets inR d p (SPARSE) andR hd p (R c p (SPARSE)), as well as in some nondeterministic reduction classes to sparse sets.
Url:
DOI: 10.1007/BF01201814
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001341
Links to Exploration step
ISTEX:1BE62514B9085FFD1DA6A76728DEBFADE1A09AF8Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Upper bounds for the complexity of sparse and tally descriptions</title>
<author><name sortKey="Arvind, V" sort="Arvind, V" uniqKey="Arvind V" first="V." last="Arvind">V. Arvind</name>
<affiliation wicri:level="1"><mods:affiliation>Department of Computer Science, Institute of Mathematical Sciences, C.I.T. Campus, 600113, Madras, India</mods:affiliation>
<country xml:lang="fr">Inde</country>
<wicri:regionArea>Department of Computer Science, Institute of Mathematical Sciences, C.I.T. Campus, 600113, Madras</wicri:regionArea>
</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="1"><mods:affiliation>Abteilung für Theoretische Informatik, Universität Ulm, D-89069, Ulm, Germany</mods:affiliation>
<country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Abteilung für Theoretische Informatik, Universität Ulm, D-89069, Ulm</wicri:regionArea>
</affiliation>
</author>
<author><name sortKey="Mundhenk, M" sort="Mundhenk, M" uniqKey="Mundhenk M" first="M." last="Mundhenk">M. Mundhenk</name>
<affiliation wicri:level="1"><mods:affiliation>Lehrstuhl IV-Informatik, Universität Trier, D-54286, Trier, Germany</mods:affiliation>
<country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Lehrstuhl IV-Informatik, Universität Trier, D-54286, Trier</wicri:regionArea>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:1BE62514B9085FFD1DA6A76728DEBFADE1A09AF8</idno>
<date when="1996" year="1996">1996</date>
<idno type="doi">10.1007/BF01201814</idno>
<idno type="url">https://api.istex.fr/document/1BE62514B9085FFD1DA6A76728DEBFADE1A09AF8/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001341</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001341</idno>
<idno type="wicri:Area/Istex/Curation">001229</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Upper bounds for the complexity of sparse and tally descriptions</title>
<author><name sortKey="Arvind, V" sort="Arvind, V" uniqKey="Arvind V" first="V." last="Arvind">V. Arvind</name>
<affiliation wicri:level="1"><mods:affiliation>Department of Computer Science, Institute of Mathematical Sciences, C.I.T. Campus, 600113, Madras, India</mods:affiliation>
<country xml:lang="fr">Inde</country>
<wicri:regionArea>Department of Computer Science, Institute of Mathematical Sciences, C.I.T. Campus, 600113, Madras</wicri:regionArea>
</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="1"><mods:affiliation>Abteilung für Theoretische Informatik, Universität Ulm, D-89069, Ulm, Germany</mods:affiliation>
<country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Abteilung für Theoretische Informatik, Universität Ulm, D-89069, Ulm</wicri:regionArea>
</affiliation>
</author>
<author><name sortKey="Mundhenk, M" sort="Mundhenk, M" uniqKey="Mundhenk M" first="M." last="Mundhenk">M. Mundhenk</name>
<affiliation wicri:level="1"><mods:affiliation>Lehrstuhl IV-Informatik, Universität Trier, D-54286, Trier, Germany</mods:affiliation>
<country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Lehrstuhl IV-Informatik, Universität Trier, D-54286, Trier</wicri:regionArea>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="j">Mathematical systems theory</title>
<title level="j" type="abbrev">Math. Systems Theory</title>
<idno type="ISSN">0025-5661</idno>
<idno type="eISSN">1433-0490</idno>
<imprint><publisher>Springer-Verlag</publisher>
<pubPlace>New York</pubPlace>
<date type="published" when="1996-02-01">1996-02-01</date>
<biblScope unit="volume">29</biblScope>
<biblScope unit="issue">1</biblScope>
<biblScope unit="page" from="63">63</biblScope>
<biblScope unit="page" to="94">94</biblScope>
</imprint>
<idno type="ISSN">0025-5661</idno>
</series>
<idno type="istex">1BE62514B9085FFD1DA6A76728DEBFADE1A09AF8</idno>
<idno type="DOI">10.1007/BF01201814</idno>
<idno type="ArticleID">BF01201814</idno>
<idno type="ArticleID">Art6</idno>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0025-5661</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: We investigate the complexity of computing small descriptions for sets in various reduction classes to sparse sets. For example, we show that if a setA and its complement conjunctively reduce to some sparse set, then they also are conjunctively reducible to a P(A ⊕ SAT)-printable tally set. As a consequence, the class IC[log,poly] of sets with low instance complexity is contained in theEL 1 Σ -level of the extended low hierarchy. By refining our techniques, we also show that all word-decreasing self-reducible sets in IC[log, poly] are in NP ∩ co-NP and therefore low for NP. We derive similar results for sets inR d p (SPARSE) andR hd p (R c p (SPARSE)), as well as in some nondeterministic reduction classes to sparse sets.</div>
</front>
</TEI>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001229 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 001229 | 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= Curation |type= RBID |clé= ISTEX:1BE62514B9085FFD1DA6A76728DEBFADE1A09AF8 |texte= Upper bounds for the complexity of sparse and tally descriptions }}
![]() | This area was generated with Dilib version V0.6.31. | ![]() |