An Application of Matroid Theory to the SAT Problem.

Oliver Kullmann

Published in: Computational Complexity Conference (2000)

Keyphrases

sat problem
satisfiability problem
np complete
phase transition
constraint satisfaction problems
sat solvers
max sat
random sat instances
davis putnam
reinforcement learning
search algorithm
state space
sat instances
boolean satisfiability