Exponential lower bounds on the size of OBDDs representing integer division

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1350, Issue , 1997, Pages 163-172

  Horiyama, Takashi ^a   Yajima, Shuzo ^b  

^a KYOTO UNIVERSITY   (Japan)

^b KANSAI UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS; DIRECTED GRAPHS;

DIRECTED ACYCLIC GRAPH (DAG); INTEGER DIVISION; LOWER BOUNDS; ORDERED BINARY DECISION DIAGRAMS; VARIABLE ORDER;

BOOLEAN FUNCTIONS;

EID: 84958059004     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63890-3_19     Document Type: Conference Paper

References (13)

1. S.B. Akers, “Binary Decision Diagrams,” IEEE Trans. Comput., vol.C-27, no.6, pp.509-516, 1978.
2. R.E. Bryant, “Graph-Based Algorithms for Boolean Function Manipulation,” IEEE Trans. Comput., vol.C-35, no.8, pp.667-691, 1986.
3. 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.
4. J.R. Butch, E.M. Clarke, K.L. McMillan and D.L. Dill, “Sequential Circuit Verification Using Symbolic Model Checking,” in Proc. 27th ACM/IEEE DAC, pp.46-51, 1990.
5. J. Gergov, “Time-Space Tradeoffs for Integer Multiplication on Various Types of Input Oblivious Sequential Machines,” Information Processing Letters, vol.51, no.5, pp.265-269, 1994.
6. T. ttoriyama, Y. Takenaga and S. Yajima, “Solving an NP-complete Combinatorial Problem Using Multiple OBDDs,” KUIS Technical report, KUIS-96-0005, 1996.
7. R.J. Lipton and R. Sedgewick, “Lower Bounds for VLSI,” in Proc. 13th STOC, pp.300-307, 1981.
8. H. Sawada, Y. Takenaga and S. Yajima, “On the Computational Power of Binary Decision Diagrams,” IEICE Trans. Information and Systems, vol.E77-D, no.6, pp.611-618, 1994.
9. I. Semba and S. Yajima, “Combinatorial Algorithms Using Boolean Processing,” Trans. IPSJ, vol.35, no.9, pp.1661-1673, 1994.
10. K. Takagi, K. Nitta, H. Bouno, Y. Takenaga and S. Yajima, “Computational Power of Nondeterministic Ordered Binary Decision Diagrams and Their Subclasses,” IEICE Trans. Fundamentals, vol.ES0-A, no.4, pp.663-669, 1997.
11. N. Takahashi, N. Ishiura and S. Yajima, “Fault Simulation for Multiple Faults Using BDD Representation of Fault Sets,” in Proc. IEEE/ACM ICCAD, pp.550-553, 1991.
12. C.D. Thompson, “Area-Time Complexity for VLSI,” in Proc. llth STOC, pp.81-88, 1979.
13. A.C. Yao, “The Entropic Limitations of VLSI Computations,” in Proc. t3th STOC, pp.308-311, 1981.