Blockwise variable orderings for shared BDDs
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 636-644
- https://doi.org/10.1007/bfb0055814
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Improving the variable ordering of OBDDs is NP-completeIEEE Transactions on Computers, 1996
- NC-ALGORITHMS FOR OPERATIONS ON BINARY DECISION DIAGRAMSParallel Processing Letters, 1993
- The complexity of the optimal variable ordering problems of shared binary decision diagramsPublished by Springer Nature ,1993
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- Finding the optimal variable ordering for binary decision diagramsIEEE Transactions on Computers, 1990
- 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