An Almost Quadratic Class of Satisfiability Problems.

Published in: ECAI (1996)

Keyphrases

satisfiability problem
np complete
temporal logic
sat problem
search algorithm
phase transition
stochastic local search
davis putnam
computational complexity
sat instances
pspace complete
solving hard