Login / Signup
Using configurable computing to accelerate Boolean satisfiability.
Peixin Zhong
Margaret Martonosi
Pranav Ashar
Sharad Malik
Published in:
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (1999)
Keyphrases
</>
boolean satisfiability
sat solvers
boolean optimization
sat solving
randomly generated
probabilistic planning
sat problem
maximum satisfiability
branch and bound algorithm
integer linear programming
computational complexity
domain independent
satisfiability problem
symmetry breaking