On the size of binary decision diagrams representing Boolean functions
Authors:
- Y. BreitbartYBY. Breitbart
- H. HuntHHH. Hunt
- D. RosenkrantzDRD. Rosenkrantz
- 1 July 1995
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 145 (1-2) , 45-69
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Branching programs provide lower bounds on the areas of multilective deterministic and nondeterministic VLSI-circuitsInformation and Computation, 1992
- Finding the optimal variable ordering for binary decision diagramsIEEE Transactions on Computers, 1990
- Binary decision tree test functionsIEEE Transactions on Computers, 1988
- A lower bound for read-once-only branching programsJournal of Computer and System Sciences, 1987
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Bounds for Width Two Branching ProgramsSIAM Journal on Computing, 1986
- Functional Test Generation for Digital Circuits Described Using Binary Decision DiagramsIEEE Transactions on Computers, 1986
- Simulation of MOS Circuits by Decision DiagramsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
- Binary Decision DiagramsIEEE Transactions on Computers, 1978
- Some bounds on the complexity of predicate recognition by finite automataJournal of Computer and System Sciences, 1976