Polynomial interpretations and the complexity of algorithms
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.
Unable to display preview. Download preview PDF.
- N. Dershowitz and J-P. Jouannaud. Notations for rewriting, 1991. LATEXscript.Google Scholar
- O. Geupel. Terminationbeweise bei Termersetzungssytem, 1988. Diplomarbeit.Google Scholar
- G. Huet and D.C. Oppen. Equations and rewrite rules: A survey. In R. Book, editor, Formal Language Theory: Perspectives and Open Problems, pages 349–405. Academic Press, 1980.Google Scholar
- D. Lankford. Canonical algebraic simplification in computational logic. Report ATP-25, University of Texas, 1975.Google Scholar
- D. Lankford. On proving term rewriting systems are noetherian. Report MTP-3, Louisiana Tech. University, 1979.Google Scholar
- C. Lautemann. A note on polynomial interpretation. In Bulletin of the European Association for Theoretical Computer Science, volume 4, pages 129–131, October 1988.Google Scholar