ATPG for Reversible Circuits Using Simulation, Boolean Satisfiability, and Pseudo Boolean Optimization.
Robert WilleHongyan ZhangRolf DrechslerPublished in: ISVLSI (2011)
Keyphrases
- boolean satisfiability
- pseudo boolean optimization
- sat solvers
- sat solving
- probabilistic planning
- boolean optimization
- constraint satisfaction problems
- cellular automata
- branch and bound algorithm
- sat problem
- symmetry breaking
- combinatorial problems
- lower bound
- randomly generated
- integer linear programming
- orders of magnitude
- np complete