A Critique of a Polynomial-time SAT Solver Devised by Sergey Gubin
Ian ChristopherDennis HuoBryan JacobsPublished in: CoRR (2008)
Keyphrases
- sat solvers
- boolean formula
- orders of magnitude
- sat solving
- constraint satisfaction
- sat problem
- boolean satisfiability
- propositional satisfiability
- sat instances
- search space
- search strategies
- max sat
- search tree
- special case
- computational complexity
- unsatisfiable cores
- clause learning
- linear constraints
- phase transition
- constraint satisfaction problems
- np hard
- sat encodings
- data structure
- objective function