Solving satisfiability problems using elliptic approximations - effective branching rules.

Joost P. Warners Hans van Maaren

Published in: Discret. Appl. Math. (2000)

Keyphrases

satisfiability problem
stochastic local search
phase transition
solving hard
np complete
temporal logic
sat instances
finite domain
search algorithm
search tree
pspace complete
stochastic local search algorithms
branch and bound
numerical methods
sat problem
graph coloring problems