Uniformly defining complexity classes of functions

DOI10.1007/BFB0028595MaRDI QIDQ4381403zbMATH OpenFDO

Authors Sven Kosub, H. Schmitz, Heribert Vollmer

Publication date 27 July 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0028595

zbMATH Keywords

polynomial time nondeterministic Turing transducers

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS
• A taxonomy of complexity classes of functions
• Complexity classes of optimization functions
• Polynomial-time hierarchies on some classes of functions. I
• scientific article; zbMATH DE number 2040949

Cited in

(6)

• A taxonomy of complexity classes of functions
• Polynomial-time hierarchies on some classes of functions. I
• scientific article; zbMATH DE number 58287 (Why is no real title available?)
• UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS
• Towards a Unified Complexity Theory of Total Functions
• Classes of computable functions defined by bounds on computation

This page was built for publication: Uniformly defining complexity classes of functions

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