Login / Signup
Measuring the Hardness of SAT Instances.
Carlos Ansótegui
Maria Luisa Bonet
Jordi Levy
Felip Manyà
Published in:
AAAI (2008)
Keyphrases
</>
sat instances
phase transition
random instances
easy hard easy pattern
satisfiability problem
sat solvers
sat problem
randomly generated
np complete
computational properties
constraint satisfaction
max sat
hard problems
boolean satisfiability
stochastic local search
data structure
expressive power