scientific article; zbMATH DE number 4090803

zbMATH Open0666.68049MaRDI QIDQ3817613FDOQ3817613

Authors:

Publication date: 1986

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

Recommendations

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

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)

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)