Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses.
Holger DellDieter van MelkebeekPublished in: STOC (2010)
Keyphrases
- np complete
- computational complexity
- satisfiability problem
- polynomial time complexity
- special case
- bounded treewidth
- hierarchical structure
- worst case
- terminological reasoning
- polynomial size
- regularization method
- sat problem
- lower level
- phase transition
- propositional logic
- decision procedures
- np hard
- conjunctive normal form
- approximation algorithms
- expressive power
- least squares
- class hierarchy
- computational properties
- query language
- optimal solution
- satisfiability testing
- learning algorithm