scientific article; zbMATH DE number 512990

MaRDI QIDQ4281699zbMATH OpenFDO

Authors Heribert Vollmer

Publication date 10 March 1994

zbMATH Keywords

complexity classesdiagonalizationminimal pairsgap languagecomplexity cores

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Gap-languages and log-time complexity classes
• The recursion-theoretic structure of complexity classes
• scientific article; zbMATH DE number 3877163
• scientific article; zbMATH DE number 3841832
• A classification of complexity core lattices

Cited in

(4)

• The recursion-theoretic structure of complexity classes
• Freezing sandpiles and Boolean threshold networks: equivalence and complexity
• On distinguishing \(\mathbf {NC^1}\) and \(\mathbf {NL}\)
• Gap-languages and log-time complexity classes

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