Reference11 articles.
1. T. Arai, and G. Moser, Proofs of termination of rewrite systems for polytime functions. In: Proceeding of Foundations of Software Technology and Theoretical Computer Science 2005. Lecture Notes in Computer Science 3821, pp. 529-540 (Springer, 2005).
2. T. Arai, and N. Eguchi, A new function algebra of EXPTIME functions by safe nested recursion. Accepted in ACM Transactions on Computational Logic.
3. A term rewriting characterization of the polytime functions and related complexity classes;Beckmann;Arch. Math. Logic,1996
4. A new recursion-theoretic characterization of the polytime functions;Bellantoni;Computational Complexity,1992
5. G. Bonfante, J. Y. Marion, and J. Y. Moyen, On lexicographic termination ordering with space bounded certifications. In: Perspectives of System Informatics. Lecture Notes in Computer Science 2244, pp. 482-493 (Springer, 2001).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献