Hidden Gold in Random Generation of SAT Satisfiable Instances.

Thierry Castell Michel Cayrol

Published in: IJCAI (1) (1997)

Keyphrases

random instances
sat instances
phase transition
randomly generated
sat problem
satisfiability problem
random sat
truth assignment
easy hard easy pattern
sat solvers

np complete problems
random sat instances
randomly chosen
stochastic local search
boolean satisfiability
max sat
np complete
solving hard
propositional satisfiability
maximum satisfiability

constraint satisfaction
combinatorial problems
search problems
branch and bound algorithm
computational properties
search procedures
search algorithm
hard problems
graph coloring
cnf formula

lower bound
propositional formulas
temporal logic
boolean functions
polynomial size
sat solving
davis putnam
search strategies
graph matching