A Polynomial-Time Reduction from the 3SAT Problem to the Generalized String Puzzle Problem.
Chuzo IwamotoKento SasakiKenichi MoritaPublished in: Algorithms (2012)
Keyphrases
- sat problem
- satisfiability problem
- sat solvers
- constraint satisfaction problems
- np complete
- max sat
- phase transition
- sat solving
- boolean satisfiability
- randomly generated
- sat instances
- computational complexity
- special case
- propositional satisfiability
- weighted max sat
- random sat instances
- decision problems
- data structure
- stochastic local search
- davis putnam
- boolean formula
- search algorithm
- branch and bound
- constraint satisfaction
- orders of magnitude
- sufficient conditions
- information retrieval systems
- bounded treewidth
- lower bound
- polynomial size
- maximum satisfiability
- information retrieval