scientific article; zbMATH DE number 4090803

MaRDI QIDQ3817613zbMATHFDO

Authors

Publication date 1986

zbMATH Keywords

computational complexityComplexity theorycomplexity theoryNP-completenonstandard models of arithmeticreducibilitiespolynomial time hierarchyprimitive recursivitysparse sts

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Nonstandard models of arithmetic (03H15)

Recommendations

• Theory of computation.
• Nondeterministic polynomial-time computations and models of arithmetic
• On sparseness, reducibilities, and complexity
• scientific article; zbMATH DE number 52121
• Complexity and dimension

Cited in

(1)

• Complexity theory

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