Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank.
Nicola GalesiOliver KullmannPublished in: SAT (Selected Papers (2004)
Keyphrases
- singular values
- sat solvers
- satisfiability problem
- decision makers
- special case
- higher order
- decision making
- decision rules
- singular value decomposition
- pairwise
- stochastic local search
- approximation algorithms
- np hard
- propositional satisfiability
- sat instances
- emerging patterns
- sat problem
- decision process
- tractable classes
- optimal solution
- randomly generated
- data structure
- search algorithm
- phase transition
- search engine
- constraint satisfaction
- high order
- computational complexity