On Lexicographic Termination Ordering with Space Bound Certifications-Reference-Cited by-同舟云学术

On Lexicographic Termination Ordering with Space Bound Certifications

Published:2001 Issue: Volume: Page:482-493
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bonfante Guillaume,Marion Jean-Yves,Moyen Jean-Yves

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45575-2_46

Reference23 articles.

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

2. R. Benzinger. Automated complexity analysis of NUPRL extracts. PhD thesis, Cornell University, 1999.

3. Lect Notes Comput Sci;G. Bonfante,1999

4. A. Chandra, D. Kozen, and L. Stockmeyer. Alternation. Journal of the ACM, 28:114–133, 1981.

5. A. Cobham. The intrinsic computational difficulty of functions. In Y. Bar-Hillel, editor, Proceedings of the International Conference on Logic, Methodology, and Philosophy of Science, pages 24–30. North-Holland, Amsterdam, 1962.

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

1. Analyzing Innermost Runtime Complexity Through Tuple Interpretations;Electronic Proceedings in Theoretical Computer Science;2023-03-23

2. Automatic Synthesis of Logical Models for Order-Sorted First-Order Theories;Journal of Automated Reasoning;2017-07-12

3. Formalizing Termination Proofs under Polynomial Quasi-interpretations;Electronic Proceedings in Theoretical Computer Science;2015-09-09

4. Complexity Analysis of Precedence Terminating Infinite Graph Rewrite Systems;Electronic Proceedings in Theoretical Computer Science;2015-05-26

5. On quasi-interpretations, blind abstractions and implicit complexity;Mathematical Structures in Computer Science;2012-02-02