Polynomial interpretations and the complexity of algorithms
Identifieur interne : 002F89 ( Istex/Checkpoint ); précédent : 002F88; suivant : 002F90Polynomial interpretations and the complexity of algorithms
Auteurs : Adam Cichon [France] ; Pierre Lescanne [France]Source :
- 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
Affiliations:
- France
- Grand Est, Lorraine (région)
- Nancy, Villers-lès-Nancy
- Centre national de la recherche scientifique, Institut national de recherche en informatique et en automatique, Laboratoire lorrain de recherche en informatique et ses applications, Université de Lorraine
Links toward previous steps (curation, corpus...)
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></author><author><name sortKey="Lescanne, Pierre" sort="Lescanne, Pierre" uniqKey="Lescanne P" first="Pierre" last="Lescanne">Pierre Lescanne</name><affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="region" nuts="2">Lorraine (région)</region></placeName><orgName type="laboratoire" n="5">Laboratoire lorrain de recherche en informatique et ses applications</orgName><orgName type="university">Université de Lorraine</orgName><orgName type="institution">Centre national de la recherche scientifique</orgName><orgName type="institution">Institut national de recherche en informatique et en automatique</orgName></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><idno type="wicri:Area/Istex/Curation">001244</idno><idno type="wicri:Area/Istex/Checkpoint">002F89</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002F89</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 wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>CRIN & INRIA-Lorraine, BP 101, 54602, Villers-lès-Nancy</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Villers-lès-Nancy</settlement></placeName></affiliation></author><author><name sortKey="Lescanne, Pierre" sort="Lescanne, Pierre" uniqKey="Lescanne P" first="Pierre" last="Lescanne">Pierre Lescanne</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>CRIN & INRIA-Lorraine, BP 101, 54602, Villers-lès-Nancy</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Villers-lès-Nancy</settlement></placeName><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="region" nuts="2">Lorraine (région)</region></placeName><orgName type="laboratoire" n="5">Laboratoire lorrain de recherche en informatique et ses applications</orgName><orgName type="university">Université de Lorraine</orgName><orgName type="institution">Centre national de la recherche scientifique</orgName><orgName type="institution">Institut national de recherche en informatique et en automatique</orgName></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><affiliations><list><country><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Nancy</li><li>Villers-lès-Nancy</li></settlement><orgName><li>Centre national de la recherche scientifique</li><li>Institut national de recherche en informatique et en automatique</li><li>Laboratoire lorrain de recherche en informatique et ses applications</li><li>Université de Lorraine</li></orgName></list><tree><country name="France"><region name="Grand Est"><name sortKey="Cichon, Adam" sort="Cichon, Adam" uniqKey="Cichon A" first="Adam" last="Cichon">Adam Cichon</name></region><name sortKey="Lescanne, Pierre" sort="Lescanne, Pierre" uniqKey="Lescanne P" first="Pierre" last="Lescanne">Pierre Lescanne</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002F89 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd -nk 002F89 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Checkpoint
|type= RBID
|clé= ISTEX:4F7CBBACE72DCF2E11908B1E33257F5C26BB9E0E
|texte= Polynomial interpretations and the complexity of algorithms
}}
| This area was generated with Dilib version V0.6.33. |  |