Complexity Classes and Rewrite Systems with Polynomial Interpretation-Reference-Cited by-同舟云学术

Complexity Classes and Rewrite Systems with Polynomial Interpretation

Published:1999 Issue: Volume: Page:372-384
ISSN:0302-9743
Container-title:Computer Science Logic
language:
Short-container-title:

Author:

Bonfante G.,Cichon A.,Marion J. Y,Touzet H.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/10703163_25

Reference10 articles.

1. Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the polytime functions. Computational Complexity 2, 97–110 (1992)

2. Ben Cherifa, A., Lescanne, P.: Termination of rewriting systems by polynomial interpretations and its implementation. Science of computer Programming 9, 131–159 (1987)

3. Lecture Notes in Computer Science;E.A. Cichon,1992

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)

5. Dershowitz, N., Jouannaud, J.P.: Rewrite systems. Handbook of Theoretical Computer Science, vol. B. North-Holland, Amsterdam

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Derivational Complexity and Context-Sensitive Rewriting;Journal of Automated Reasoning;2021-08-12

2. Relative Undecidability in Term Rewriting;Information and Computation;2002-10

3. Recursive Derivational Length Bounds for Confluent Term Rewrite Systems Research Paper;Rewriting Techniques and Applications;2002

4. On Lexicographic Termination Ordering with Space Bound Certifications;Lecture Notes in Computer Science;2001

5. Efficient First Order Functional Program Interpreter with Time Bound Certifications;Logic for Programming and Automated Reasoning