Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank.
Nicola GalesiOliver KullmannPublished in: SAT (2004)
Keyphrases
- singular values
- special case
- decision making
- satisfiability problem
- decision problems
- search algorithm
- computational complexity
- hypergraph model
- sat solving
- sat solvers
- decision rules
- approximation algorithms
- decision makers
- higher order
- decision process
- sat problem
- boolean satisfiability
- pairwise
- search strategies
- phase transition
- worst case
- propositional satisfiability
- np hard
- tractable classes