scientific article; zbMATH DE number 1114331

MaRDI QIDQ4376046zbMATH OpenFDO

Authors Peter Clote

Publication date 8 February 1998

zbMATH Keywords

exponential time functions of linear growthfunction algebra characterizationsafe course-of-values recursion scheme

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• A new function algebra of EXPTIME functions by safe nested recursion
• Function algebraic characterizations of the polytime functions
• A lexicographic path order with slow growing derivation bounds
• Safe recursive set functions

Cited in

(6)

• Function algebraic characterizations of the polytime functions
• On the computational complexity of imperative programming languages
• A new function algebra of EXPTIME functions by safe nested recursion
• Safe recursive set functions
• Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze
• Simulation of simultaneous safe recursion over an arbitrary structure

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 Q4376046)