Hard satisfiable 3-SAT instances via autocorrelation.
Srinivasan ArunachalamIlias S. KotsireasPublished in: J. Satisf. Boolean Model. Comput. (2016)
Keyphrases
- sat instances
- random instances
- satisfiability problem
- sat solvers
- sat problem
- random sat
- randomly generated
- phase transition
- computational properties
- propositional satisfiability
- boolean satisfiability
- search tree
- constraint satisfaction problems
- np complete
- stochastic local search
- max sat
- hard problems
- lower bound
- decision problems
- orders of magnitude
- optimal solution
- search strategies
- evolutionary algorithm
- davis putnam