An Efficient, Scalable Hardware Engine for Boolean SATisfiability.

Mandar Waghmode Kanupriya Gulati Sunil P. Khatri Weiping Shi

Published in: ICCD (2006)

Keyphrases

boolean satisfiability
sat solvers
sat solving
boolean optimization
probabilistic planning
branch and bound algorithm
sat problem
integer linear programming
randomly generated
symmetry breaking
maximum satisfiability
constraint satisfaction
max sat
random sat instances
np hard