Login / Signup
How to generate weakly nondecisive SAT instances.
Csaba Biró
Gábor Kusper
Tibor Tajti
Published in:
SISY (2013)
Keyphrases
</>
sat instances
sat solvers
satisfiability problem
sat problem
randomly generated
artificial intelligence
phase transition
orders of magnitude
stochastic local search
database
dynamic programming
search tree
boolean satisfiability