scientific article; zbMATH DE number 2110623

zbMath1064.03030MaRDI QIDQ4823143

Helmut Schwichtenberg, Stephen J. Bellantoni

Publication date: 26 October 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polynomial-time computable functions

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Higher-type and set recursion theory (03D65)

Related Items

A complexity analysis of functional interpretations, An arithmetic for polynomial-time computation, A higher-order characterization of probabilistic polynomial time