A Computational Trichotomy for Connectivity of Boolean Satisfiability.

Konrad W. Schwerdtfeger

Published in: CoRR (2013)

Keyphrases

boolean satisfiability
boolean optimization
sat solvers
branch and bound algorithm
probabilistic planning
sat solving
randomly generated
integer linear programming
sat problem
symmetry breaking
maximum satisfiability
max sat