Boolean Expression Diagrams
- 1 December 2002
- journal article
- Published by Elsevier in Information and Computation
- Vol. 179 (2) , 194-212
- https://doi.org/10.1006/inco.2001.2948
Abstract
No abstract availableKeywords
Funding Information
- Teknologi og Produktion, Det Frie Forskningsråd
This publication has 6 references indexed in Scilit:
- Indexed BDDs: algorithmic advances in techniques to represent and verify Boolean functionsIEEE Transactions on Computers, 1997
- Graph driven BDDs — a new data structure for Boolean functionsTheoretical Computer Science, 1995
- Efficient Boolean manipulation with OBDD's can be extended to FBDD'sIEEE Transactions on Computers, 1994
- Extended BDDs: Trading of canonicity for structure in verification algorithmsFormal Methods in System Design, 1994
- On the complexity of branching programs and decision trees for clique functionsJournal of the ACM, 1988
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986