Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT.
Harold S. ConnamacherPublished in: Theor. Comput. Sci. (2012)
Keyphrases
- np complete
- satisfiability problem
- sat problem
- randomly generated
- sat solvers
- np complete problems
- sat instances
- random sat
- phase transition
- boolean satisfiability
- sat solving
- davis putnam
- propositional satisfiability
- max sat
- constraint satisfaction problems
- computational complexity
- boolean formula
- np hard
- cnf formula
- stochastic local search algorithms
- polynomial time complexity
- davis putnam logemann loveland
- conjunctive queries
- stochastic local search
- search strategies
- data complexity
- branch and bound algorithm
- conp complete
- orders of magnitude
- special case