Computational power of nondeterministic ordered binary decision diagrams and their subclasses

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E80-A, Issue 4, 1997, Pages 663-669

  Takagi, Kazuyoshi ^a   Nitta, Koyo ^a   Bouno, Hironori ^a   Takenaga, Yasuhiko ^a   Yajima, Shuzo ^a  

^a NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

Boolean function; Combinational circuit; Computational complexity; Cutwidth; Ordered binary decision diagram; Satisfiability; Sum of product form; Ternary decision diagram; Zero suppressed bdd

Indexed keywords

BINARY SEQUENCES; BOOLEAN FUNCTIONS; COMBINATORIAL CIRCUITS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY;

BINARY DECISION DIAGRAMS;

DECISION TABLES;

EID: 0031117082     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. S.B. Akers, Binary decision diagrams, IEEE Trans. Comput., vol.C-27, no.6, pp.506-516, 1978.
2. R.E. Bryant, Graph-based algorithms for boolean function manipulation, IEEE Trans. Comput., vol.C-35, no.8, pp.677-691, 1986.
3. N. Ishiura and S. Yajima, A class of logic functions expressible by a polynomial-size binary decision diagram, Proc. Synthesis and Simulation Meeting and Int. Interchange (SASIMI'90), pp.48-54, 1990.
4. H. Sawada, Y. Takenaga, and S. Yajima, On the computational power of Binary Decision Diagrams, IEICE Trans. Inf. & Syst., vol.E77-D, no.6, pp.611-618, 1994.
5. C.L. Berman, Circuit width, register allocation, and ordered binary decision diagrams, IEEE Trans. Comput.-Aided Des. Integrated Circuits & Syst., vol.10, no.8, pp.1059-1066, 1991.
6. K.L. McMillan, Symbolic Model Checking - An approach to the state explosion problem, Ph.D. thesis, Carnegie Mellon University, 1992.
7. K. Hamaguchi and S. Yajima, On a relation between the complexity of equivalence checking problem and circuit structure for combinational circuits, IEICE National Convention Record, Spring'93, SA-2-3, 1993.
8. O. Coudert and J.C. Madre, Implicit and incremental computation of primes and essential primes of Boolean functions, Proc. 29th ACM/IEEE DAC, pp.36-39, 1992.
9. S. Minato, Zero-suppressed BDDs for set manipulation in combinatorial problems, Proc. 30th ACM/IEEE DAC, pp.272-277, 1993.
10. K. Yasuoka, A new method to represent sets of products: Ternary decision diagrams, IEICE Trans. Fundamentals, vol.E78-A, no. 12, 1995.
11. C. Meinel, Modified Branching Programs and Their Computational Power, LNCS 370, Springer-Verlag, 1989.
12. N. Pippenger, On simultaneous resource bounds, Proc. 20th FOCS, pp.307-311, 1979.
13. P.W. Dymond and S.A. Cook, Complexity theory of parallel time and hardware, Information and Computation, vol.80, pp.205-226, 1989.
14. R.E. Bryant, On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication, IEEE Trans. Comput., vol.40, no.2, pp.205-213, 1991.
15. K. Nitta, Expressive power of binary decision diagrams representing boolean formulas, Master Thesis, Department of Information Science, Kyoto University, 1995.
16. Y. Manabe, K. Hagihira, and N. Tokura, The minimum bisection widths of the cube-connected-cycles graph and cube graph, IEICE Trans., vol.J67-D, no.6, pp.647-654, 1984.