NC-ALGORITHMS FOR OPERATIONS ON BINARY DECISION DIAGRAMS
1993 ◽
Vol 03
(01)
◽
pp. 3-12
◽
Keyword(s):
(Ordered) binary decision diagrams are a powerful representation for Boolean functions and are widely used in logical synthesis, verification, test pattern generation or as part of CAD tools. NC-algorithms are presented for the most important operations on this representation, e.g. evaluation for a given input, minimization, satisfiability, redundancy test, replacement of variables by constants or functions, equivalence test and synthesis. The algorithms have logarithmic run time on CRCW COMMON PRAMs with a polynomial number of processors.
2015 ◽
Vol 59
(3)
◽
pp. 532-559
◽
2000 ◽
Vol 103
(1-3)
◽
pp. 237-258
◽
2010 ◽
Vol 7
(1)
◽
pp. 35-58
◽
1999 ◽
Vol 09
(03n04)
◽
pp. 181-198
◽
2006 ◽
Vol 98
(1)
◽
pp. 6-10
◽