1 results
Stephen Bellantoni and Stephen Cook. A new recursion-theoretic characterization of the polytime functions. Computational complexity, vol. 2 (1992), pp. 97–110. - Arnold Beckmann and Andreas Weiermann. A term rewriting characterization of the polytime functions and related complexity classes. Archive for mathematical logic, vol. 36 (1996), pp. 11–30.
-
- Journal:
- Bulletin of Symbolic Logic / Volume 6 / Issue 3 / September 2000
- Published online by Cambridge University Press:
- 15 January 2014, pp. 351-353
- Print publication:
- September 2000
-
- Article
- Export citation