Some heuristics for generating tree-like FBDD types
- 1 January 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 15 (1) , 127-130
- https://doi.org/10.1109/43.486278
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Logic verification using binary decision diagrams in a logic synthesis environmentPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Boolean manipulation with free BDD's. First experimental resultsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- 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
- Efficient Boolean manipulation with OBDD's can be extended to FBDD'sIEEE Transactions on Computers, 1994
- Frontiers of feasible and probabilistic feasible Boolean manipulation with branching programsPublished by Springer Nature ,1993
- Variable ordering algorithms for ordered binary decision diagrams and their evaluationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1993
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Binary Decision DiagramsIEEE Transactions on Computers, 1978