OBDDs of a monotone function and its prime implicants

Theory of Computing Systems

Volumn 31, Issue 5, 1998, Pages 579-591

  Hayase, K ^a   Imai, H ^b  

^a NTT CORPORATION   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC DESIGN; LOGIC SYNTHESIS;

A-MONOTONE; ORDERED BINARY DECISION DIAGRAMS; POLYNOMIAL SIZE; PRIME IMPLICANTS; SUM OF PRODUCTS; TWO-LEVEL LOGIC MINIMIZATIONS;

BINARY DECISION DIAGRAMS;

EID: 0032380834     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240000104     Document Type: Article

References (14)

1. M. O. Ball and J. S. Provan. Disjoint products and efficient computation of reliability. Oper. Res., 36:703-715, 1988.
2. R. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput., C-35(8):677-691, 1986.
3. O. Coudert. Doing two-level logic minimization 100 times faster. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 112-121, 1995.
4. K. Hayase. On the complexity of constructing OBDDs of a monotone function and of the set of its prime implicants. Master's thesis, University of Tokyo, 1996 (available at http: //naomi . is. s .u-tokyo . ac . jp/theses .html).
5. K. Hayase, K. Sadakane, and S. Tani. Output-size sensitiveness of OBDD construction through maximal independent set problem. In COCOON '95, Lecture Notes in Computer Science, volume 959, pages 229-234. Springer-Verlag, Berlin, 1995.
6. H. Imai, S. Iwata, K. Sekine, and K. Yoshida. Combinatorial and geometric approaches to counting problems on linear matroids, graphic arrangements and partial orders. In COCOON '96, Lecture Notes in Computer Science, volume 1090, pages 68-80. Springer-Verlag, Berlin, 1996.
7. H. Imai, K. Sekine, and K. Yoshida. Binary decision diagrams and generating functions of sets related to graphs and codes. In Proc. 9th Karuizawa Workshop on Circuits and Systems, pages 91-96, 1996.
8. R. J. Lipton, D. J. Rose, and R. E. Tarjan. Generalized nested dissection. SIAM J. Numer. Anal., 16(2):346-358, 1979.
9. S. Minato. Zero-suppressed BDDs for set manipulation in combinatorial problems. In Proc. 30th ACM/IEEE DAC, pages 272-277, 1993.
10. J. Niwa, K. Sadakane, K. Hayase, and H. Imai. Parallel top-down construction of OBDDs of monotone functions. In JSPP '96, Joint Symposium on Parallel Processing, pages 161-168, 1996 (in Japanese).
11. K. Sekine and H. Imai. A unified approach via BDD to the network reliability and path numbers. Technical Report 95-09, Department of Information Science, University of Tokyo, 1995.
12. K. Sekine, H. Imai, and S. Tani. Computing the Tutte polynomial of a graph of moderate size. In ISAAC '95, Lecture Notes in Computer Science, volume 1004, pages 224-233. Springer-Verlag, Berlin, 1995.
13. S. Tani and H. Imai. A reordering operation for an ordered binary decision diagram and an extended framework for combinatorics of graphs. In ISAAC '94, Lecture Notes in Computer Science, volume 834, pages 575-583. Springer-Verlag, Berlin, 1994.
14. D. J. A. Welsh. Matroid Theory. Academic Press, New York, 1976.