The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions
- 1 January 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 43 (11) , 1262-1269
- https://doi.org/10.1109/12.324559
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Efficient implementation of a BDD packagePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Graph driven BDDs — a new data structure for Boolean functionsTheoretical Computer Science, 1995
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- On the OBDD-representation of general Boolean functionsIEEE Transactions on Computers, 1992
- On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplicationIEEE Transactions on Computers, 1991
- Finding the optimal variable ordering for binary decision diagramsIEEE Transactions on Computers, 1990
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Binary Decision DiagramsIEEE Transactions on Computers, 1978
- The Synthesis of Two-Terminal Switching CircuitsBell System Technical Journal, 1949