Real or natural number interpretation and their effect on complexity

Interpretation methods have been introduced in the 70s by Lankford [1] in rewriting theory to prove termination. Actually, as shown by Bonfante et al. [2], an interpretation of a program induces a bound on its complexity. However, Lankford's original analysis depends deeply on the Archimedean p...

Celý popis

Podrobná bibliografie

Vydáno v:	Theoretical computer science Ročník 585; s. 25 - 40
Hlavní autoři:	Bonfante, Guillaume, Deloup, Florian, Henrot, Antoine
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 20.06.2015
Témata:	Algebra Algebraic geometry Complexity Implicit computational complexity Integers Number theory Polynomial interpretation Polynomials Real numbers Term rewriting Term rewriting Polynomial interpretation Algebraic geometry Implicit computational complexity
ISSN:	0304-3975, 1879-2294
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!