Download:
|
by Takashi Horiyama, Shuzo Yajima
http://yase.lab2.kuis.kyoto-u.ac.jp/staffs/horiyama/paper/ISAAC97.ps
Add To MetaCart
Abstract:
Abstract. An Ordered Binary Decision Diagram (OBDD) is a directed acyclic graph representing a Boolean function. The size of OBDDs largely depends on the variable ordering. In this paper, we show the size of the OBDD representing the i-th bit of the output of n-bit/n-bit integer division is\Omega
Citations
|
2410
|
Graph-based algorithms for Boolean function manipulation
– Bryant
- 1986
|
|
279
|
Binary Decision Diagram
– Akers
- 1978
|
|
235
|
On the complexity of VLSI implementations and graph representations of boolean functions with applications to integer multiplication
– Bryant
- 1991
|
|
179
|
Sequential circuit verification using symbolic model checking
– Burch, Clarke, et al.
- 1990
|
|
74
|
Area-Time complexity for VLSI
– Thompson
- 1979
|
|
27
|
Lower Bounds for VLSI
– Lipton, Sedgewick
- 1981
|
|
23
|
The entropic limitations on VLSI computations
– Yao
- 1981
|
|
12
|
Time-space tradeoffs for integer multiplication on various types of input oblivious sequential machines
– Gergov
- 1994
|
|
3
|
Combinatorial Algorithms Using Boolean Processing
– Semba, Yajima
- 1994
|
|
3
|
Fault Simulation for Multiple Faults Using BDD Representation of Fault Sets
– Takahashi, Ishiura, et al.
- 1991
|
|
1
|
Solving an NP-complete Combinatorial Problem Using Multiple OBDDs
– Horiyama, Takenaga, et al.
- 1996
|
|
1
|
On the Computational Power of Binary Decision Diagrams
– Sawada, Takenaga, et al.
- 1994
|
|
1
|
Computational Power of Nondeterministic Ordered Binary Decision Diagrams and Their Subclasses
– Takagi, Nitta, et al.
- 1997
|
