Sciweavers

16 search results - page 4 / 4
» NP-completeness results for edge modification problems
Sort
View
ICCAD
2001
IEEE
144views Hardware» more  ICCAD 2001»
15 years 10 months ago
Faster SAT and Smaller BDDs via Common Function Structure
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah