scientific article; zbMATH DE number 4112573

MaRDI QIDQ3835449zbMATH OpenFDO

Authors Theodore A. Slaman, Wolfgang Maass

Publication date 1989

zbMATH Keywords

fine structure of Ppolynomially computable functions

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4134023
• Completeness problems in classes of computable named functions
• Predicatively computable functions on sets
• On classes of computable functions
• scientific article; zbMATH DE number 65741

Cited in

(13)

• Polynomial upper bounds on the size of changes of a RAM+BOOL program as a tool for proving belonging to FP
• The Veblen functions for computability theorists
• scientific article; zbMATH DE number 5761697 (Why is no real title available?)
• A simple observation regarding iterations of finite-valued polynomial-time functions
• scientific article; zbMATH DE number 4033742 (Why is no real title available?)
• scientific article; zbMATH DE number 4094815 (Why is no real title available?)
• Accessible telephone directories
• Computability and the Implicit Function Theorem
• Polynomially bounded sequences and polynomial sequences
• On classes of computable functions
• Classes of computable functions defined by bounds on computation
• A note on the relation between polynomial time functionals and Constable's class \(\mathcal K\)
• Polynomial time computations in models of ET

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3835449)