scientific article; zbMATH DE number 4115977

MaRDI QIDQ4730783zbMATH OpenFDO

Authors Dieter Spreen

Publication date 1988

zbMATH Keywords

\(DTIMEF(Pol_{\Sigma })\)\(NTIMEF(Pol_{\Sigma })\)functions computable in deterministic polynomialfunctions computable in nondeterministic polynomial time

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Functions computable in polynomial space
• scientific article; zbMATH DE number 3904571
• Safe Weak Minimization Revisited
• scientific article; zbMATH DE number 3872715
• scientific article; zbMATH DE number 1018349

Cited in

(9)

• Functions computable with limited access to NP
• Functions computable in polynomial space
• Minimization and \(\mathbf{NP}\) multifunctions
• scientific article; zbMATH DE number 3872715 (Why is no real title available?)
• A simple observation regarding iterations of finite-valued polynomial-time functions
• scientific article; zbMATH DE number 3904571 (Why is no real title available?)
• Some characterizations of functions computable in on-line arithmetic
• A Shift-free Characterization of NP within Interval-valued Computing
• 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 Q4730783)