A Computational Trichotomy for Connectivity of Boolean Satisfiability.

Konrad W. Schwerdtfeger

Published in: J. Satisf. Boolean Model. Comput. (2014)

Keyphrases

boolean satisfiability
sat solvers
sat problem
integer linear programming
probabilistic planning
boolean optimization
branch and bound algorithm
sat solving
symmetry breaking
maximum satisfiability
cutting plane
phase transition
orders of magnitude
combinatorial problems
max sat
sat instances