scientific article; zbMATH DE number 139620

zbMATH Open0760.68029MaRDI QIDQ4029599FDOQ4029599

Authors: James P. Jones 

Publication date: 28 March 1993

Title of this publication is not available (Why is that?)

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

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)

Cited In (6)

• A taxonomy of complexity classes of functions
• A simple observation regarding iterations of finite-valued polynomial-time functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Note on The Functions Which Are Not Polynomial Time Computable From Their Graphs
• A syntactical definition of the problem

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)