On monotonous oracle machines
Identifieur interne : 001104 ( Istex/Corpus ); précédent : 001103; suivant : 001105On monotonous oracle machines
Auteurs : M. MundhenkSource :
- 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
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><affiliation><mods:affiliation>Fachbereich IV-Informatik, Universität Trier, D-54286, Trier, Germany</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: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></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><mods:affiliation>Fachbereich IV-Informatik, Universität Trier, D-54286, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: mundhenk@ti.uni-trier.de</mods:affiliation></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><istex><corpusName>springer</corpusName><author><json:item><name>M. Mundhenk</name><affiliations><json:string>Fachbereich IV-Informatik, Universität Trier, D-54286, Trier, Germany</json:string><json:string>E-mail: mundhenk@ti.uni-trier.de</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>ReviewPaper</json:string></originalGenre><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.</abstract><qualityIndicators><score>5.96</score><pdfVersion>1.3</pdfVersion><pdfPageSize>439.208 x 666 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>550</abstractCharCount><pdfWordCount>5804</pdfWordCount><pdfCharCount>24632</pdfCharCount><pdfPageCount>13</pdfPageCount><abstractWordCount>80</abstractWordCount></qualityIndicators><title>On monotonous oracle machines</title><chapterId><json:string>32</json:string><json:string>Chap32</json:string></chapterId><refBibs><json:item><author><json:item><name>V Arvind</name></json:item><json:item><name>J K6bler</name></json:item><json:item><name>M,V Mundhenk</name></json:item><json:item><name>J Arvind</name></json:item><json:item><name>M Kfbler</name></json:item><json:item><name> Mundhenk</name></json:item></author><host><pages><last>151</last><first>140</first></pages><author></author><title>Proceedings 12th Con[erence on the Foundations of Software Technology ff Theoretical Computer Science Mathematical Systems Theory Buhrman, L. Longpr6, and E. Spaan. SPARSE reduces conjunctively to TALLY Proc. 8th Structure in Complexity Theory Conference</title><publicationDate>1988</publicationDate></host><title>On bounded truth-table, conjunctive , and randomized reductions to sparse sets Lecture Notes in Computer Science #:652 Upper bounds on the complexity of sparse and tally descriptions</title><publicationDate>1988</publicationDate></json:item><json:item><author><json:item><name>S Cook</name></json:item></author><host><pages><last>58</last><first>151</first></pages><author></author><title>Proocedings of the 3rd AC;'M Syrup. on Theory o] Computing</title><publicationDate>1971</publicationDate></host><title>The complexity of theorem proving procedures</title><publicationDate>1971</publicationDate></json:item><json:item><author><json:item><name>R Gavahlh</name></json:item><json:item><name>O Watanabe</name></json:item></author><host><author></author><title>SIAM Journal on Computing</title><publicationDate>1994</publicationDate></host><title>On the computational complexil.y of small descriptions</title><publicationDate>1994</publicationDate></json:item><json:item><author><json:item><name>L Hemachandra</name></json:item><json:item><name>M Ogiwara</name></json:item><json:item><name>O Watanabe</name></json:item></author><host><author></author><title>Proc. 7th Structure in Complexity Theory Conference</title><publicationDate>1992</publicationDate></host><title>ttow hard are sparse sets</title><publicationDate>1992</publicationDate></json:item><json:item><author><json:item><name>R Karp</name></json:item></author><host><pages><last>104</last><first>85</first></pages><author></author><title>Complexity of Computer Computations</title><publicationDate>1972</publicationDate></host><title>Reducibility among combinatorial problems</title><publicationDate>1972</publicationDate></json:item><json:item><host><pages><last>87</last><first>62</first></pages><author><json:item><name>K No</name></json:item></author><title>Distinguishing conjunctive and disjunctive reducibilities by sparse sets. lnJormation and Computation</title><publicationDate>1989</publicationDate></host></json:item><json:item><author><json:item><name>R,E Ladner</name></json:item><json:item><name>N,A Lynch</name></json:item><json:item><name>A,L Selman</name></json:item></author><host><volume>1</volume><pages><last>123</last><first>103</first></pages><author></author><title>Theoretical Computer Science</title><publicationDate>1975</publicationDate></host><title>A comparison of polynomial time reducibilities</title><publicationDate>1975</publicationDate></json:item><json:item><author><json:item><name>A,L Sehnan</name></json:item></author><host><volume>19</volume><pages><last>304</last><first>287</first></pages><author></author><title>Th.eoretical Computer Science</title><publicationDate>1982</publicationDate></host><title>Reductions on NP and p-selective sets</title><publicationDate>1982</publicationDate></json:item><json:item><author><json:item><name>K,W K W Wagner</name></json:item><json:item><name> Wagner</name></json:item></author><host><volume>51</volume><pages><last>80833</last><first>53</first></pages><issue>195</issue><author></author><title>Theoretical Computer Science SL4M Journal on Computing</title><publicationDate>1987</publicationDate></host><title>More complicated questions about maxima and minima, and some closures of NP Bounded query classes</title><publicationDate>1987</publicationDate></json:item><json:item><author><json:item><name>O Watanabe</name></json:item></author><host><pages><last>146</last><first>138</first></pages><author></author><title>Proe. 1987 Structure in Complexity Theory Con]erence</title><publicationDate>1987</publicationDate></host><title>Polynomial time reducibility to a set. of small density</title><publicationDate>1987</publicationDate></json:item></refBibs><genre><json:string>conference</json:string></genre><serie><editor><json:item><name>Gerhard Goos</name></json:item><json:item><name>Juris Hartmanis</name></json:item><json:item><name>Jan van Leeuwen</name></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Lecture Notes in Computer Science</title><copyrightDate>1995</copyrightDate></serie><host><editor><json:item><name>Ricardo Baeza-Yates</name></json:item><json:item><name>Eric Goles</name></json:item><json:item><name>Patricio V. Poblete</name></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Computation by Abstract Devices</value></json:item><json:item><value>Algorithm Analysis and Problem Complexity</value></json:item><json:item><value>Logics and Meanings of Programs</value></json:item><json:item><value>Combinatorics</value></json:item></subject><isbn><json:string>978-3-540-59175-7</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>LATIN '95: Theoretical Informatics</title><bookId><json:string>3540591753</json:string></bookId><volume>911</volume><pages><last>448</last><first>436</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-540-49220-7</json:string></eisbn><copyrightDate>1995</copyrightDate><doi><json:string>10.1007/3-540-59175-3</json:string></doi></host><publicationDate>2005</publicationDate><copyrightDate>1995</copyrightDate><doi><json:string>10.1007/3-540-59175-3_108</json:string></doi><id>4226D76F10704F0F480693B04DBE6ADF7DF6CB36</id><score>0.62462574</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/4226D76F10704F0F480693B04DBE6ADF7DF6CB36/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/4226D76F10704F0F480693B04DBE6ADF7DF6CB36/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/4226D76F10704F0F480693B04DBE6ADF7DF6CB36/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">On monotonous oracle machines</title><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>Springer-Verlag, 1995</p></availability><date>1995</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">On monotonous oracle machines</title><author xml:id="author-1"><persName><forename type="first">M.</forename><surname>Mundhenk</surname></persName><email>mundhenk@ti.uni-trier.de</email><affiliation>Fachbereich IV-Informatik, Universität Trier, D-54286, Trier, Germany</affiliation></author></analytic><monogr><title level="m">LATIN '95: Theoretical Informatics</title><title level="m" type="sub">Second Latin American Symposium Valparaíso, Chile, April 3–7, 1995 Proceedings</title><idno type="pISBN">978-3-540-59175-7</idno><idno type="eISBN">978-3-540-49220-7</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/3-540-59175-3</idno><idno type="book-ID">3540591753</idno><idno type="book-title-ID">42662</idno><idno type="book-volume-number">911</idno><idno type="book-chapter-count">38</idno><editor><persName><forename type="first">Ricardo</forename><surname>Baeza-Yates</surname></persName></editor><editor><persName><forename type="first">Eric</forename><surname>Goles</surname></persName></editor><editor><persName><forename type="first">Patricio</forename><forename type="first">V.</forename><surname>Poblete</surname></persName></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2005-06-06"></date><biblScope unit="volume">911</biblScope><biblScope unit="page" from="436">436</biblScope><biblScope unit="page" to="448">448</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">Gerhard</forename><surname>Goos</surname></persName></editor><editor><persName><forename type="first">Juris</forename><surname>Hartmanis</surname></persName></editor><editor><persName><forename type="first">Jan</forename><surname>van Leeuwen</surname></persName></editor><biblScope><date>1995</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="series-Id">558</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></fileDesc><profileDesc><creation><date>1995</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>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.</p></abstract><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><label>I16013</label><label>I16021</label><label>I1603X</label><label>M17009</label><item><term>Computer Science</term></item><item><term>Computation by Abstract Devices</term></item><item><term>Algorithm Analysis and Problem Complexity</term></item><item><term>Logics and Meanings of Programs</term></item><item><term>Combinatorics</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2005-06-06">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-11-22">References added</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2017-01-20">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/4226D76F10704F0F480693B04DBE6ADF7DF6CB36/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle><SeriesAbbreviatedTitle>Lect Notes Comput Sci</SeriesAbbreviatedTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Jan</GivenName><Particle>van</Particle><FamilyName>Leeuwen</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo MediaType="eBook" Language="En" BookProductType="Proceedings" TocLevels="0" NumberingStyle="Unnumbered"><BookID>3540591753</BookID><BookTitle>LATIN '95: Theoretical Informatics</BookTitle><BookSubTitle>Second Latin American Symposium Valparaíso, Chile, April 3–7, 1995 Proceedings</BookSubTitle><BookVolumeNumber>911</BookVolumeNumber><BookDOI>10.1007/3-540-59175-3</BookDOI><BookTitleID>42662</BookTitleID><BookPrintISBN>978-3-540-59175-7</BookPrintISBN><BookElectronicISBN>978-3-540-49220-7</BookElectronicISBN><BookChapterCount>38</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1995</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I16013" Priority="1" Type="Secondary">Computation by Abstract Devices</BookSubject><BookSubject Code="I16021" Priority="2" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject><BookSubject Code="I1603X" Priority="3" Type="Secondary">Logics and Meanings of Programs</BookSubject><BookSubject Code="M17009" Priority="4" Type="Secondary">Combinatorics</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Ricardo</GivenName><FamilyName>Baeza-Yates</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Eric</GivenName><FamilyName>Goles</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Patricio</GivenName><GivenName>V.</GivenName><FamilyName>Poblete</FamilyName></EditorName></Editor></EditorGroup></BookHeader><Chapter ID="Chap32" Language="En"><ChapterInfo ChapterType="ReviewPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ChapterID>32</ChapterID><ChapterDOI>10.1007/3-540-59175-3_108</ChapterDOI><ChapterSequenceNumber>32</ChapterSequenceNumber><ChapterTitle Language="En">On monotonous oracle machines</ChapterTitle><ChapterFirstPage>436</ChapterFirstPage><ChapterLastPage>448</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1995</CopyrightYear></ChapterCopyright><ChapterHistory><OnlineDate><Year>2005</Year><Month>6</Month><Day>6</Day></OnlineDate></ChapterHistory><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><BookID>3540591753</BookID><BookTitle>LATIN '95: Theoretical Informatics</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>M.</GivenName><FamilyName>Mundhenk</FamilyName></AuthorName><Contact><Email>mundhenk@ti.uni-trier.de</Email><URL>lhttp://www.informatik.uni-trier.de/~mundhenk/</URL></Contact></Author><Affiliation ID="Aff1"><OrgDivision>Fachbereich IV-Informatik</OrgDivision><OrgName>Universität Trier</OrgName><OrgAddress><Postcode>D-54286</Postcode><City>Trier</City><Country>Germany</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>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 <Emphasis Type="Italic">syntactical</Emphasis> 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.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>On monotonous oracle machines</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>On monotonous oracle machines</title></titleInfo><name type="personal"><namePart type="given">M.</namePart><namePart type="family">Mundhenk</namePart><affiliation>Fachbereich IV-Informatik, Universität Trier, D-54286, Trier, Germany</affiliation><affiliation>E-mail: mundhenk@ti.uni-trier.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference" displayLabel="ReviewPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2005-06-06</dateIssued><copyrightDate encoding="w3cdtf">1995</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract 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.</abstract><relatedItem type="host"><titleInfo><title>LATIN '95: Theoretical Informatics</title><subTitle>Second Latin American Symposium Valparaíso, Chile, April 3–7, 1995 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Ricardo</namePart><namePart type="family">Baeza-Yates</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Eric</namePart><namePart type="family">Goles</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Patricio</namePart><namePart type="given">V.</namePart><namePart type="family">Poblete</namePart><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">1995</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I16013">Computation by Abstract Devices</topic><topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic><topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic><topic authority="SpringerSubjectCodes" authorityURI="M17009">Combinatorics</topic></subject><identifier type="DOI">10.1007/3-540-59175-3</identifier><identifier type="ISBN">978-3-540-59175-7</identifier><identifier type="eISBN">978-3-540-49220-7</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">42662</identifier><identifier type="BookID">3540591753</identifier><identifier type="BookChapterCount">38</identifier><identifier type="BookVolumeNumber">911</identifier><part><date>1995</date><detail type="volume"><number>911</number><caption>vol.</caption></detail><extent unit="pages"><start>436</start><end>448</end></extent></part><recordInfo><recordOrigin>Springer-Verlag, 1995</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Goos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Juris</namePart><namePart type="family">Hartmanis</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jan</namePart><namePart type="family">van Leeuwen</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">1995</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag, 1995</recordOrigin></recordInfo></relatedItem><identifier type="istex">4226D76F10704F0F480693B04DBE6ADF7DF6CB36</identifier><identifier type="DOI">10.1007/3-540-59175-3_108</identifier><identifier type="ChapterID">32</identifier><identifier type="ChapterID">Chap32</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag, 1995</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag, 1995</recordOrigin></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 001104 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001104 | 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:4226D76F10704F0F480693B04DBE6ADF7DF6CB36
|texte= On monotonous oracle machines
}}
| This area was generated with Dilib version V0.6.31. |  |