scientific article; zbMATH DE number 139620

MaRDI QIDQ4029599zbMATH OpenFDO

Authors James P. Jones

Publication date 28 March 1993

zbMATH Keywords

functions computable in deterministic polynomial timefunctions computable in nondeterministic polynomial time

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4049046
• A taxonomy of complexity classes of functions
• A syntactical definition of the problem
• scientific article; zbMATH DE number 4066861
• Positive relativizations of the \(P=?\) NP problem

Cited in

(6)

• A taxonomy of complexity classes of functions
• scientific article; zbMATH DE number 4134023 (Why is no real title available?)
• A simple observation regarding iterations of finite-valued polynomial-time functions
• A syntactical definition of the problem
• scientific article; zbMATH DE number 4049046 (Why is no real title available?)
• A Note on The Functions Which Are Not Polynomial Time Computable From Their Graphs

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