Determining minimal testsets for reversible circuits using Boolean satisfiability.
Hongyan ZhangStefan FrehseRobert WilleRolf DrechslerPublished in: AFRICON (2011)
Keyphrases
- boolean satisfiability
- unsatisfiable cores
- sat solvers
- probabilistic planning
- branch and bound algorithm
- boolean optimization
- sat problem
- integer linear programming
- maximum satisfiability
- sat solving
- randomly generated
- symmetry breaking
- max sat
- cellular automata
- markov chain
- satisfiability problem
- phase transition
- combinatorial problems
- np complete
- sat instances
- linear programming
- boolean formula