Complexity Classes and Rewrite Systems with Polynomial Interpretation

  • G. Bonfante
  • A. Cichon
  • J. Y Marion
  • H. Touzet
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1584)


We are concerned with functions over words which are computable by means of a rewrite system admitting polynomial interpretation termination proofs. We classify them according to the interpretations of successor symbols. This leads to the definition of three classes, which turn out to be exactly the poly-time, linear exponential-time and doubly linear exponential time computable functions. As a consequence, we also characterize the linear space computable functions.


Turing Machine Complexity Class Function Symbol Computable Function Termination Proof 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the polytime functions. Computational Complexity 2, 97–110 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Ben Cherifa, A., Lescanne, P.: Termination of rewriting systems by polynomial interpretations and its implementation. Science of computer Programming 9, 131–159 (1987)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Cichon, E.A., Lescanne, P.: Polynomial interpretations and the complexity of algorithms. In: Kapur, D. (ed.) CADE 1992. LNCS, vol. 607, pp. 139–147. Springer, Heidelberg (1992)Google Scholar
  4. 4.
    Cobham, A.: The intrinsic computational difficulty of functions. In: Bar-Hillel, Y. (ed.) Proceedings of the International Conference on Logic, Methodology, and Philosophy of Science, pp. 24–30. North-Holland, Amsterdam (1962)Google Scholar
  5. 5.
    Dershowitz, N., Jouannaud, J.P.: Rewrite systems. Handbook of Theoretical Computer Science, vol. B. North-Holland, AmsterdamGoogle Scholar
  6. 6.
    Giesl, J.: Generating polynomial orderings for termination proofs. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol. 914, pp. 427–431. Springer, Heidelberg (1995)Google Scholar
  7. 7.
    Gurevich, Y.: Algebras of feasible functions. In: Twenty Fourth Symposium on Foundations of Computer Science, pp. 210–214. IEEE Computer Society Press, Los Alamitos (1983)Google Scholar
  8. 8.
    Hofbauer, D., Lautemann, C.: Termination proofs and the length of derivations. In: RTA-1988. LNCS, vol. 355Google Scholar
  9. 9.
    Lankford, D.S.: On proving term rewriting systems are Noetherien. Technical Report Memo MTP-3, louisiana Technical University, Ruston, LA (1979)Google Scholar
  10. 10.
    Leivant, D.: Predicative recurrence and computational complexity I: Word recurrence and poly-time. In: Clote, P., Remmel, J. (eds.) Feasible Mathematrics II, Birkhauser-Boston (1994)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • G. Bonfante
    • 1
  • A. Cichon
    • 1
  • J. Y Marion
    • 1
  • H. Touzet
    • 1
  1. 1.Loria, Calligramme projectVandœuvre-lès-Nancy CedexFrance

Personalised recommendations