On the computational power of binary decision diagram with redundant variables
- 1 January 1996
- journal article
- Published by Springer Nature in Formal Methods in System Design
- Vol. 8 (1) , 65-89
- https://doi.org/10.1007/bf00121263
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Hardware algorithms for VLSI systemsPublished by Springer Nature ,2006
- Edge-valued binary decision for multi-level hierarchical verificationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- IBDDs: an efficient functional representation for digital circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Extended BDDs: Trading of canonicity for structure in verification algorithmsFormal Methods in System Design, 1994
- On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplicationIEEE Transactions on Computers, 1991
- Using BDDs to verify multipliersPublished by Association for Computing Machinery (ACM) ,1991
- Shared binary decision diagram with attributed edges for efficient Boolean function manipulationPublished by Association for Computing Machinery (ACM) ,1990
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- On uniform circuit complexityJournal of Computer and System Sciences, 1981
- Binary Decision DiagramsIEEE Transactions on Computers, 1978