Login / Signup
Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem.
John Franco
Marvin C. Paull
Published in:
Discret. Appl. Math. (1983)
Keyphrases
</>
satisfiability problem
davis putnam
sat problem
np complete
temporal logic
stochastic local search
sat instances
search algorithm
phase transition
stochastic local search algorithms
propositional logic
max sat
constraint satisfaction
random sat