On monotonous oracle machines
Identifieur interne : 000287 ( LNCS/Analysis ); précédent : 000286; suivant : 000288On monotonous oracle machines
Auteurs : M. Mundhenk [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1995.
Abstract
Abstract: Polynomial time oracle machines having restricted access to an oracle were studied e.g. in [LLS75, Wag90]. These restrictions — e.g. bounded number of queries, non-adaptive reductions — can be seen as syntactical restrictions, since one can recursively represent all the machines underlying these restrictions. In this paper, different kinds of semantically restricted polynomial time oracle machines are defined and investigated. It is shown that the strongest type of those machines w.r.t. NP oracles is the weakest w.r.t. sparse oracles.
Url:
DOI: 10.1007/3-540-59175-3_108
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001104
- to stream Istex, to step Curation: 000F93
- to stream Istex, to step Checkpoint: 001140
- to stream Main, to step Merge: 002E45
- to stream Main, to step Curation: 002942
- to stream Main, to step Exploration: 002942
- to stream LNCS, to step Extraction: 000287
Links to Exploration step
ISTEX:4226D76F10704F0F480693B04DBE6ADF7DF6CB36Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">On monotonous oracle machines</title><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:4226D76F10704F0F480693B04DBE6ADF7DF6CB36</idno><date when="1995" year="1995">1995</date><idno type="doi">10.1007/3-540-59175-3_108</idno><idno type="url">https://api.istex.fr/document/4226D76F10704F0F480693B04DBE6ADF7DF6CB36/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001104</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001104</idno><idno type="wicri:Area/Istex/Curation">000F93</idno><idno type="wicri:Area/Istex/Checkpoint">001140</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001140</idno><idno type="wicri:doubleKey">0302-9743:1995:Mundhenk M:on:monotonous:oracle</idno><idno type="wicri:Area/Main/Merge">002E45</idno><idno type="wicri:Area/Main/Curation">002942</idno><idno type="wicri:Area/Main/Exploration">002942</idno><idno type="wicri:Area/LNCS/Extraction">000287</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">On monotonous oracle machines</title><author><name sortKey="Mundhenk, M" sort="Mundhenk, M" uniqKey="Mundhenk M" first="M." last="Mundhenk">M. 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>1995</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">4226D76F10704F0F480693B04DBE6ADF7DF6CB36</idno><idno type="DOI">10.1007/3-540-59175-3_108</idno><idno type="ChapterID">32</idno><idno type="ChapterID">Chap32</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: Polynomial time oracle machines having restricted access to an oracle were studied e.g. in [LLS75, Wag90]. These restrictions — e.g. bounded number of queries, non-adaptive reductions — can be seen as syntactical restrictions, since one can recursively represent all the machines underlying these restrictions. In this paper, different kinds of semantically restricted polynomial time oracle machines are defined and investigated. It is shown that the strongest type of those machines w.r.t. NP oracles is the weakest w.r.t. sparse oracles.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country></list><tree><country name="Allemagne"><noRegion><name sortKey="Mundhenk, M" sort="Mundhenk, M" uniqKey="Mundhenk M" first="M." last="Mundhenk">M. Mundhenk</name></noRegion><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/LNCS/Analysis
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000287 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/LNCS/Analysis/biblio.hfd -nk 000287 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= LNCS
|étape= Analysis
|type= RBID
|clé= ISTEX:4226D76F10704F0F480693B04DBE6ADF7DF6CB36
|texte= On monotonous oracle machines
}}
| This area was generated with Dilib version V0.6.31. |  |