scientific article; zbMATH DE number 1555981

zbMATH Open0953.68562MaRDI QIDQ4525754FDOQ4525754

Authors: Ingrid Biehl 

Publication date: 24 January 2001

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

Recommendations

• The density and complexity of polynomial cores for intractable sets
• A classification of complexity core lattices
• scientific article; zbMATH DE number 3887072
• The structure of generalized complexity cores
• On inefficient special cases of NP-complete problems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (2)

• Kolmogorov complexity cores
• The structure of generalized complexity cores

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