scientific article; zbMATH DE number 403953

MaRDI QIDQ4201937zbMATH OpenFDO

Authors Uwe Schöning

Publication date 6 September 1993

zbMATH Keywords

NP-complete problemssatisfiability

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On hard instances
• Instance complexity
• scientific article; zbMATH DE number 4001485
• The density and complexity of polynomial cores for intractable sets
• scientific article; zbMATH DE number 1500526

Cited in

(11)

• On hard instances
• Rational analysis, intractability, and the prospects of `as if'-explanations
• On inefficient special cases of NP-complete problems
• Hardness of fully dense problems
• The density and complexity of polynomial cores for intractable sets
• scientific article; zbMATH DE number 4095440 (Why is no real title available?)
• Intractability and the use of heuristics in psychological explanations
• scientific article; zbMATH DE number 4001485 (Why is no real title available?)
• The Complexity and Distribution of Hard Problems
• Unsolvability Cores in Classification Problems
• The complexity of the co-occurrence problem

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