Hostname: page-component-7f64f4797f-8cpv7 Total loading time: 0 Render date: 2025-11-10T03:47:28.716Z Has data issue: false hasContentIssue false
  • English
  • Français

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.

Review products

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.

Published online by Cambridge University Press:  15 January 2014

Karl-Heinz Niggl
Karl-Heinz Niggl*
Affiliation:
Fakultät für Informatik und Automatisierung, Fachgebiet Komplexitätstheorie, Technische, Universität Ilmenau, PF 100565, D-98684 Ilmenau, Germany., niggl@theoinf.tu-ilmenau.de.
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Information

Type
Reviews
Information
Bulletin of Symbolic Logic , Volume 6 , Issue 3 , September 2000 , pp. 351 - 353
Copyright
Copyright © Association for Symbolic Logic 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable