Reducing hard SAT instances to polynomial ones.
Olivier FourdrinoyÉric GrégoireBertrand MazureLakhdar SaisPublished in: IRI (2007)
Keyphrases
- sat instances
- random instances
- sat solvers
- satisfiability problem
- random sat
- sat problem
- randomly generated
- phase transition
- computational properties
- polynomial size
- boolean satisfiability
- stochastic local search
- search algorithm
- database
- optimal solution
- random sat instances
- max sat
- branch and bound
- np complete
- lower bound
- genetic algorithm