Recognition of Tractable Satisfiability Problems through Balanced Polynomial Representations.

Joost P. Warners Hans van Maaren

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

Keyphrases

satisfiability problem
np complete
temporal logic
search algorithm
phase transition
solving hard
sat problem
stochastic local search
pspace complete
special case
np hard
search space
bounded treewidth
davis putnam
mazurkiewicz traces
computational complexity
knowledge base
sat instances