Polynomial interpretations and the complexity of algorithms
Identifieur interne : 001261 ( Istex/Corpus ); précédent : 001260; suivant : 001262Polynomial interpretations and the complexity of algorithms
Auteurs : Adam Cichon ; Pierre LescanneSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main result of this paper is that a polynomial interpretation termination proof of a rewrite system R which computes a number theoretic function implies a polynomial bound on that function's rate of growth.
Url:
DOI: 10.1007/3-540-55602-8_161
Links to Exploration step
ISTEX:4F7CBBACE72DCF2E11908B1E33257F5C26BB9E0ELe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Polynomial interpretations and the complexity of algorithms</title>
<author><name sortKey="Cichon, Adam" sort="Cichon, Adam" uniqKey="Cichon A" first="Adam" last="Cichon">Adam Cichon</name>
<affiliation><mods:affiliation>CRIN & INRIA-Lorraine, BP 101, 54602, Villers-lès-Nancy, France</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Lescanne, Pierre" sort="Lescanne, Pierre" uniqKey="Lescanne P" first="Pierre" last="Lescanne">Pierre Lescanne</name>
<affiliation><mods:affiliation>CRIN & INRIA-Lorraine, BP 101, 54602, Villers-lès-Nancy, France</mods:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:4F7CBBACE72DCF2E11908B1E33257F5C26BB9E0E</idno>
<date when="1992" year="1992">1992</date>
<idno type="doi">10.1007/3-540-55602-8_161</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-J5S1FMFW-1/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001261</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001261</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Polynomial interpretations and the complexity of algorithms</title>
<author><name sortKey="Cichon, Adam" sort="Cichon, Adam" uniqKey="Cichon A" first="Adam" last="Cichon">Adam Cichon</name>
<affiliation><mods:affiliation>CRIN & INRIA-Lorraine, BP 101, 54602, Villers-lès-Nancy, France</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Lescanne, Pierre" sort="Lescanne, Pierre" uniqKey="Lescanne P" first="Pierre" last="Lescanne">Pierre Lescanne</name>
<affiliation><mods:affiliation>CRIN & INRIA-Lorraine, BP 101, 54602, Villers-lès-Nancy, France</mods:affiliation>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<title level="s" type="abbrev">Lect Notes Comput Sci</title>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main result of this paper is that a polynomial interpretation termination proof of a rewrite system R which computes a number theoretic function implies a polynomial bound on that function's rate of growth.</div>
</front>
</TEI>
<istex><corpusName>springer-ebooks</corpusName>
<author><json:item><name>Adam Cichon</name>
<affiliations><json:string>CRIN & INRIA-Lorraine, BP 101, 54602, Villers-lès-Nancy, France</json:string>
</affiliations>
</json:item>
<json:item><name>Pierre Lescanne</name>
<affiliations><json:string>CRIN & INRIA-Lorraine, BP 101, 54602, Villers-lès-Nancy, France</json:string>
</affiliations>
</json:item>
</author>
<arkIstex>ark:/67375/HCB-J5S1FMFW-1</arkIstex>
<language><json:string>eng</json:string>
</language>
<originalGenre><json:string>ReviewPaper</json:string>
</originalGenre>
<abstract>Abstract: The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main result of this paper is that a polynomial interpretation termination proof of a rewrite system R which computes a number theoretic function implies a polynomial bound on that function's rate of growth.</abstract>
<qualityIndicators><refBibsNative>false</refBibsNative>
<abstractWordCount>61</abstractWordCount>
<abstractCharCount>389</abstractCharCount>
<keywordCount>0</keywordCount>
<score>5.201</score>
<pdfWordCount>2469</pdfWordCount>
<pdfCharCount>11859</pdfCharCount>
<pdfVersion>1.3</pdfVersion>
<pdfPageCount>9</pdfPageCount>
<pdfPageSize>468 x 684 pts</pdfPageSize>
</qualityIndicators>
<title>Polynomial interpretations and the complexity of algorithms</title>
<chapterId><json:string>11</json:string>
<json:string>Chap11</json:string>
</chapterId>
<genre><json:string>conference</json:string>
</genre>
<serie><title>Lecture Notes in Computer Science</title>
<language><json:string>unknown</json:string>
</language>
<copyrightDate>1992</copyrightDate>
<issn><json:string>0302-9743</json:string>
</issn>
<eissn><json:string>1611-3349</json:string>
</eissn>
<editor><json:item><name>Jörg Siekmann</name>
</json:item>
<json:item><name>G. Goos</name>
</json:item>
<json:item><name>J. Hartmanis</name>
</json:item>
</editor>
</serie>
<host><title>Automated Deduction—CADE-11</title>
<language><json:string>unknown</json:string>
</language>
<copyrightDate>1992</copyrightDate>
<doi><json:string>10.1007/3-540-55602-8</json:string>
</doi>
<issn><json:string>0302-9743</json:string>
</issn>
<eissn><json:string>1611-3349</json:string>
</eissn>
<eisbn><json:string>978-3-540-47252-0</json:string>
</eisbn>
<bookId><json:string>3540556028</json:string>
</bookId>
<isbn><json:string>978-3-540-55602-2</json:string>
</isbn>
<volume>607</volume>
<pages><first>139</first>
<last>147</last>
</pages>
<genre><json:string>book-series</json:string>
</genre>
<editor><json:item><name>Deepak Kapur</name>
</json:item>
</editor>
<subject><json:item><value>Computer Science</value>
</json:item>
<json:item><value>Computer Science</value>
</json:item>
<json:item><value>Artificial Intelligence (incl. Robotics)</value>
</json:item>
<json:item><value>Mathematical Logic and Formal Languages</value>
</json:item>
<json:item><value>Mathematical Logic and Foundations</value>
</json:item>
</subject>
</host>
<ark><json:string>ark:/67375/HCB-J5S1FMFW-1</json:string>
</ark>
<publicationDate>1992</publicationDate>
<copyrightDate>1992</copyrightDate>
<doi><json:string>10.1007/3-540-55602-8_161</json:string>
</doi>
<id>4F7CBBACE72DCF2E11908B1E33257F5C26BB9E0E</id>
<score>1</score>
<fulltext><json:item><extension>pdf</extension>
<original>true</original>
<mimetype>application/pdf</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-J5S1FMFW-1/fulltext.pdf</uri>
</json:item>
<json:item><extension>zip</extension>
<original>false</original>
<mimetype>application/zip</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-J5S1FMFW-1/bundle.zip</uri>
</json:item>
<istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-J5S1FMFW-1/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Polynomial interpretations and the complexity of algorithms</title>
</titleStmt>
<publicationStmt><authority>ISTEX</authority>
<availability><licence>Springer-Verlag</licence>
</availability>
<date when="1992">1992</date>
</publicationStmt>
<notesStmt><note type="conference" source="proceedings" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</note>
<note type="publication-type" subtype="book-series" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Polynomial interpretations and the complexity of algorithms</title>
<author><persName><forename type="first">Adam</forename>
<surname>Cichon</surname>
</persName>
<affiliation><orgName type="institution">CRIN & INRIA-Lorraine</orgName>
<address><postBox>BP 101</postBox>
<postCode>54602</postCode>
<settlement>Villers-lès-Nancy</settlement>
<country key="FR">FRANCE</country>
</address>
</affiliation>
</author>
<author><persName><forename type="first">Pierre</forename>
<surname>Lescanne</surname>
</persName>
<affiliation><orgName type="institution">CRIN & INRIA-Lorraine</orgName>
<address><postBox>BP 101</postBox>
<postCode>54602</postCode>
<settlement>Villers-lès-Nancy</settlement>
<country key="FR">FRANCE</country>
</address>
</affiliation>
</author>
<idno type="istex">4F7CBBACE72DCF2E11908B1E33257F5C26BB9E0E</idno>
<idno type="ark">ark:/67375/HCB-J5S1FMFW-1</idno>
<idno type="DOI">10.1007/3-540-55602-8_161</idno>
</analytic>
<monogr><title level="m" type="main">Automated Deduction—CADE-11</title>
<title level="m" type="sub">11th International Conference on Automated Deduction Saratoga Springs, NY, USA, June 15–18, 1992 Proceedings</title>
<idno type="DOI">10.1007/3-540-55602-8</idno>
<idno type="book-id">3540556028</idno>
<idno type="ISBN">978-3-540-55602-2</idno>
<idno type="eISBN">978-3-540-47252-0</idno>
<idno type="chapter-id">Chap11</idno>
<editor><persName><forename type="first">Deepak</forename>
<surname>Kapur</surname>
</persName>
</editor>
<imprint><biblScope unit="vol">607</biblScope>
<biblScope unit="page" from="139">139</biblScope>
<biblScope unit="page" to="147">147</biblScope>
<biblScope unit="chapter-count">75</biblScope>
</imprint>
</monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<title level="s" type="abbrev">Lect Notes Comput Sci</title>
<editor><persName><forename type="first">Jörg</forename>
<surname>Siekmann</surname>
</persName>
</editor>
<editor><persName><forename type="first">G.</forename>
<surname>Goos</surname>
</persName>
</editor>
<editor><persName><forename type="first">J.</forename>
<surname>Hartmanis</surname>
</persName>
</editor>
<idno type="pISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="seriesID">558</idno>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><abstract xml:lang="en"><head>Abstract</head>
<p>The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main result of this paper is that a polynomial interpretation termination proof of a rewrite system <hi rend="NonProportional">R</hi>
which computes a number theoretic function implies a polynomial bound on that function's rate of growth.</p>
</abstract>
<textClass ana="subject"><keywords scheme="book-subject-collection"><list><label>SUCO11645</label>
<item><term>Computer Science</term>
</item>
</list>
</keywords>
</textClass>
<textClass ana="subject"><keywords scheme="book-subject"><list><label>I</label>
<item><term type="Primary">Computer Science</term>
</item>
<label>I21017</label>
<item><term type="Secondary" subtype="priority-1">Artificial Intelligence (incl. Robotics)</term>
</item>
<label>I16048</label>
<item><term type="Secondary" subtype="priority-2">Mathematical Logic and Formal Languages</term>
</item>
<label>M24005</label>
<item><term type="Secondary" subtype="priority-3">Mathematical Logic and Foundations</term>
</item>
</list>
</keywords>
</textClass>
<langUsage><language ident="EN"></language>
</langUsage>
</profileDesc>
</teiHeader>
</istex:fulltextTEI>
<json:item><extension>txt</extension>
<original>false</original>
<mimetype>text/plain</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-J5S1FMFW-1/fulltext.txt</uri>
</json:item>
</fulltext>
<metadata><istex:metadataXml wicri:clean="corpus springer-ebooks not 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>
<SeriesSubTitle Language="En">Lecture Notes in Artificial Intelligence</SeriesSubTitle>
<SeriesAbbreviatedTitle>Lect Notes Comput Sci</SeriesAbbreviatedTitle>
</SeriesInfo>
<SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Jörg</GivenName>
<FamilyName>Siekmann</FamilyName>
</EditorName>
</Editor>
<Editor><EditorName DisplayOrder="Western"><GivenName>G.</GivenName>
<FamilyName>Goos</FamilyName>
</EditorName>
</Editor>
<Editor><EditorName DisplayOrder="Western"><GivenName>J.</GivenName>
<FamilyName>Hartmanis</FamilyName>
</EditorName>
</Editor>
</EditorGroup>
</SeriesHeader>
<Book Language="En"><BookInfo MediaType="eBook" Language="En" BookProductType="Proceedings" TocLevels="0" NumberingStyle="Unnumbered"><BookID>3540556028</BookID>
<BookTitle>Automated Deduction—CADE-11</BookTitle>
<BookSubTitle>11th International Conference on Automated Deduction Saratoga Springs, NY, USA, June 15–18, 1992 Proceedings</BookSubTitle>
<BookVolumeNumber>607</BookVolumeNumber>
<BookDOI>10.1007/3-540-55602-8</BookDOI>
<BookTitleID>32613</BookTitleID>
<BookPrintISBN>978-3-540-55602-2</BookPrintISBN>
<BookElectronicISBN>978-3-540-47252-0</BookElectronicISBN>
<BookChapterCount>75</BookChapterCount>
<BookCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName>
<CopyrightYear>1992</CopyrightYear>
</BookCopyright>
<BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject>
<BookSubject Code="I21017" Priority="1" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject>
<BookSubject Code="I16048" Priority="2" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject>
<BookSubject Code="M24005" Priority="3" Type="Secondary">Mathematical Logic and Foundations</BookSubject>
<SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection>
</BookSubjectGroup>
</BookInfo>
<BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Deepak</GivenName>
<FamilyName>Kapur</FamilyName>
</EditorName>
</Editor>
</EditorGroup>
</BookHeader>
<Chapter ID="Chap11" Language="En"><ChapterInfo ChapterType="ReviewPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ChapterID>11</ChapterID>
<ChapterDOI>10.1007/3-540-55602-8_161</ChapterDOI>
<ChapterSequenceNumber>11</ChapterSequenceNumber>
<ChapterTitle Language="En">Polynomial interpretations and the complexity of algorithms</ChapterTitle>
<ChapterFirstPage>139</ChapterFirstPage>
<ChapterLastPage>147</ChapterLastPage>
<ChapterCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName>
<CopyrightYear>1992</CopyrightYear>
</ChapterCopyright>
<ChapterHistory><OnlineDate><Year>2005</Year>
<Month>6</Month>
<Day>8</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>3540556028</BookID>
<BookTitle>Automated Deduction—CADE-11</BookTitle>
</ChapterContext>
</ChapterInfo>
<ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Adam</GivenName>
<FamilyName>Cichon</FamilyName>
</AuthorName>
</Author>
<Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Pierre</GivenName>
<FamilyName>Lescanne</FamilyName>
</AuthorName>
</Author>
<Affiliation ID="Aff1"><OrgName>CRIN & INRIA-Lorraine</OrgName>
<OrgAddress><Postbox>BP 101</Postbox>
<Postcode>54602</Postcode>
<City>Villers-lès-Nancy</City>
<Country>France</Country>
</OrgAddress>
</Affiliation>
</AuthorGroup>
<Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading>
<Para>The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main result of this paper is that a polynomial interpretation termination proof of a rewrite system <Emphasis FontCategory="NonProportional">R</Emphasis>
which computes a number theoretic function implies a polynomial bound on that function's rate of growth.</Para>
</Abstract>
</ChapterHeader>
<NoBody></NoBody>
</Chapter>
</Book>
</Series>
</Publisher>
</istex:document>
</istex:metadataXml>
<mods version="3.6"><titleInfo lang="en"><title>Polynomial interpretations and the complexity of algorithms</title>
</titleInfo>
<titleInfo type="alternative" contentType="CDATA"><title>Polynomial interpretations and the complexity of algorithms</title>
</titleInfo>
<name type="personal"><namePart type="given">Adam</namePart>
<namePart type="family">Cichon</namePart>
<affiliation>CRIN & INRIA-Lorraine, BP 101, 54602, Villers-lès-Nancy, France</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Pierre</namePart>
<namePart type="family">Lescanne</namePart>
<affiliation>CRIN & INRIA-Lorraine, BP 101, 54602, Villers-lès-Nancy, France</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<typeOfResource>text</typeOfResource>
<genre displayLabel="ReviewPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="conference" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</genre>
<originInfo><publisher>Springer Berlin Heidelberg</publisher>
<place><placeTerm type="text">Berlin, Heidelberg</placeTerm>
</place>
<dateIssued encoding="w3cdtf">1992</dateIssued>
<copyrightDate encoding="w3cdtf">1992</copyrightDate>
</originInfo>
<language><languageTerm type="code" authority="rfc3066">en</languageTerm>
<languageTerm type="code" authority="iso639-2b">eng</languageTerm>
</language>
<abstract lang="en">Abstract: The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main result of this paper is that a polynomial interpretation termination proof of a rewrite system R which computes a number theoretic function implies a polynomial bound on that function's rate of growth.</abstract>
<relatedItem type="host"><titleInfo><title>Automated Deduction—CADE-11</title>
<subTitle>11th International Conference on Automated Deduction Saratoga Springs, NY, USA, June 15–18, 1992 Proceedings</subTitle>
</titleInfo>
<name type="personal"><namePart type="given">Deepak</namePart>
<namePart type="family">Kapur</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<genre type="book-series" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</genre>
<originInfo><publisher>Springer</publisher>
<copyrightDate encoding="w3cdtf">1992</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="I21017">Artificial Intelligence (incl. Robotics)</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic>
<topic authority="SpringerSubjectCodes" authorityURI="M24005">Mathematical Logic and Foundations</topic>
</subject>
<identifier type="DOI">10.1007/3-540-55602-8</identifier>
<identifier type="ISBN">978-3-540-55602-2</identifier>
<identifier type="eISBN">978-3-540-47252-0</identifier>
<identifier type="ISSN">0302-9743</identifier>
<identifier type="eISSN">1611-3349</identifier>
<identifier type="BookTitleID">32613</identifier>
<identifier type="BookID">3540556028</identifier>
<identifier type="BookChapterCount">75</identifier>
<identifier type="BookVolumeNumber">607</identifier>
<part><date>1992</date>
<detail type="volume"><number>607</number>
<caption>vol.</caption>
</detail>
<extent unit="pages"><start>139</start>
<end>147</end>
</extent>
</part>
<recordInfo><recordOrigin>Springer-Verlag, 1992</recordOrigin>
</recordInfo>
</relatedItem>
<relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title>
<subTitle>Lecture Notes in Artificial Intelligence</subTitle>
</titleInfo>
<name type="personal"><namePart type="given">Jörg</namePart>
<namePart type="family">Siekmann</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">G.</namePart>
<namePart type="family">Goos</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">J.</namePart>
<namePart type="family">Hartmanis</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<originInfo><publisher>Springer</publisher>
<copyrightDate encoding="w3cdtf">1992</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, 1992</recordOrigin>
</recordInfo>
</relatedItem>
<identifier type="istex">4F7CBBACE72DCF2E11908B1E33257F5C26BB9E0E</identifier>
<identifier type="ark">ark:/67375/HCB-J5S1FMFW-1</identifier>
<identifier type="DOI">10.1007/3-540-55602-8_161</identifier>
<identifier type="ChapterID">11</identifier>
<identifier type="ChapterID">Chap11</identifier>
<accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag, 1992</accessCondition>
<recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-RLRX46XW-4">springer</recordContentSource>
<recordOrigin>Springer-Verlag, 1992</recordOrigin>
</recordInfo>
</mods>
<json:item><extension>json</extension>
<original>false</original>
<mimetype>application/json</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-J5S1FMFW-1/record.json</uri>
</json:item>
</metadata>
</istex>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001261 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001261 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Istex |étape= Corpus |type= RBID |clé= ISTEX:4F7CBBACE72DCF2E11908B1E33257F5C26BB9E0E |texte= Polynomial interpretations and the complexity of algorithms }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |