On self-reducible sets of low information content
Identifieur interne : 002A97 ( Main/Exploration ); précédent : 002A96; suivant : 002A98On self-reducible sets of low information content
Auteurs : Martin Mundhenk [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1994.
Abstract
Abstract: Self-reducible sets have a rich internal structure. The information contained in these sets is encoded in some redundant way. Therefore a lot of the information of the set is easily accessible. In this paper it is investigated how this self-reducibility structure of a set can be used to access easily all information contained in the set, if its information content is small. It is shown that P can be characterized as class of selfreducible sets which are “almost” in P (i.e. sets in APT′). Self-reducible sets with low instance complexity (i.e. sets in IC[log,poly]) are shown to be in NP ∩ co-NP, and sets which disjunctively reduce to sparse sets or which belong to a certain superclass of the Boolean closure of sets which conjunctively reduce to sparse sets are shown to be in PNP, if they are self-reducible in a little more restricted sense of self-reducibility.
Url:
DOI: 10.1007/3-540-57811-0_17
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001235
- to stream Istex, to step Curation: 001123
- to stream Istex, to step Checkpoint: 001249
- to stream Main, to step Merge: 003023
- to stream Main, to step Curation: 002A97
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">On self-reducible sets of low information content</title><author><name sortKey="Mundhenk, Martin" sort="Mundhenk, Martin" uniqKey="Mundhenk M" first="Martin" last="Mundhenk">Martin Mundhenk</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:78B668B1AF663FF55AAE659F4729213F9F640EFC</idno><date when="1994" year="1994">1994</date><idno type="doi">10.1007/3-540-57811-0_17</idno><idno type="url">https://api.istex.fr/document/78B668B1AF663FF55AAE659F4729213F9F640EFC/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001235</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001235</idno><idno type="wicri:Area/Istex/Curation">001123</idno><idno type="wicri:Area/Istex/Checkpoint">001249</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001249</idno><idno type="wicri:doubleKey">0302-9743:1994:Mundhenk M:on:self:reducible</idno><idno type="wicri:Area/Main/Merge">003023</idno><idno type="wicri:Area/Main/Curation">002A97</idno><idno type="wicri:Area/Main/Exploration">002A97</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">On self-reducible sets of low information content</title><author><name sortKey="Mundhenk, Martin" sort="Mundhenk, Martin" uniqKey="Mundhenk M" first="Martin" last="Mundhenk">Martin Mundhenk</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich IV - Informatik, Universität Trier, D-54286, Trier</wicri:regionArea><wicri:noRegion>54286, Trier</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1994</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">78B668B1AF663FF55AAE659F4729213F9F640EFC</idno><idno type="DOI">10.1007/3-540-57811-0_17</idno><idno type="ChapterID">17</idno><idno type="ChapterID">Chap17</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Self-reducible sets have a rich internal structure. The information contained in these sets is encoded in some redundant way. Therefore a lot of the information of the set is easily accessible. In this paper it is investigated how this self-reducibility structure of a set can be used to access easily all information contained in the set, if its information content is small. It is shown that P can be characterized as class of selfreducible sets which are “almost” in P (i.e. sets in APT′). Self-reducible sets with low instance complexity (i.e. sets in IC[log,poly]) are shown to be in NP ∩ co-NP, and sets which disjunctively reduce to sparse sets or which belong to a certain superclass of the Boolean closure of sets which conjunctively reduce to sparse sets are shown to be in PNP, if they are self-reducible in a little more restricted sense of self-reducibility.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country></list><tree><country name="Allemagne"><noRegion><name sortKey="Mundhenk, Martin" sort="Mundhenk, Martin" uniqKey="Mundhenk M" first="Martin" last="Mundhenk">Martin Mundhenk</name></noRegion><name sortKey="Mundhenk, Martin" sort="Mundhenk, Martin" uniqKey="Mundhenk M" first="Martin" last="Mundhenk">Martin 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 002A97 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002A97 | 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:78B668B1AF663FF55AAE659F4729213F9F640EFC
|texte= On self-reducible sets of low information content
}}
| This area was generated with Dilib version V0.6.31. |  |