Algorithms with polynomial interpretation termination proof

We study the effect of polynomial interpretation termination proofs of deterministic (resp. non-deterministic) algorithms defined by con uent (resp. non-con uent) rewrite systems over data structures which include strings, lists and trees, and we classify them according to the interpretations of the constructors. This leads to the definition of six function classes which turn out to be exactly the deterministic (resp. non-deterministic) polynomial time, linear exponential time and linear doubly exponential time computable functions when the class is based on con uent (resp. non-con uent) rewrite systems. We also obtain a characterisation of the linear space computable functions. Finally, we demonstrate that functions with exponential interpretation termination proofs are super-elementary.

[1]  Harold Simmons,et al.  The realm of primitive recursion , 1988, Arch. Math. Log..

[2]  Dieter Hofbauer,et al.  Termination Proofs and the Length of Derivations (Preliminary Version) , 1989, RTA.

[3]  Mark W. Krentel.  The complexity of optimization problems , 1986, STOC '86.

[4]  Carl A. Gunter,et al.  In handbook of theoretical computer science , 1990 .

[5]  Nachum Dershowitz.  Orderings for Term-Rewriting Systems , 1979, FOCS.

[6]  Andreas Weiermann,et al.  Termination Proofs for Term Rewriting Systems by Lexicographic Path Orderings Imply Multiply Recursive Derivation Lengths , 1995, Theor. Comput. Sci..

[7]  Guillaume Bonfante,et al.  Complexity Classes and Rewrite Systems with Polynomial Interpretation , 1998, CSL.

[8]  Dieter Hofbauer.  Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths , 1992, Theor. Comput. Sci..

[9]  Dieter Hofbauer.  Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths , 1990, ALP.

[10]  Yuri Gurevich,et al.  Algebras of feasible functions , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[11]  J. Urgen Giesl.  Generating Polynomial Orderings for Termination Proofs ? , 1995 .

[12]  Jean-Yves Marion.  An hierarchy of terminating algorithms with semantic interpretation termination proofs , 1998 .

[13]  Yehoshua Bar-Hillel,et al.  The Intrinsic Computational Difficulty of Functions , 1969 .

[14]  Yuri Gurevich,et al.  Tailoring Recursion for Complexity , 1995, J. Symb. Log..

[15]  Pierre Lescanne,et al.  Polynomial Interpretations and the Complexity of Algorithms , 1992, CADE.

[16]  Vladimir Yu. Sazonov.  Polynomial Computability and Recursivity in Finite Domains , 1980, J. Inf. Process. Cybern..

[17]  Nachum Dershowitz,et al.  Orderings for term-rewriting systems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).