Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Shared binary decision diagram with attributed edges for efficient Boolean function manipulation
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
On the OBDD-Representation of General Boolean Functions
IEEE Transactions on Computers
Edge-valued binary decision diagrams for multi-level hierarchical verification
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Zero-suppressed BDDs for set manipulation in combinatorial problems
DAC '93 Proceedings of the 30th international Design Automation Conference
Reduction of OBDDs in linear time
Information Processing Letters
Solution of the knight's Hamiltonian path problem on chessboards
Discrete Applied Mathematics
The Size of Reduced OBDD's and Optimal Read-Once Branching Programs for Almost all Boolean Functions
IEEE Transactions on Computers
Calculation of unate cube set algebra using zero-suppressed BDDs
DAC '94 Proceedings of the 31st annual Design Automation Conference
Graph driven BDDs—a new data structure for Boolean functions
Theoretical Computer Science
Verification of arithmetic circuits with binary moment diagrams
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
On the relation between BDDs and FDDs
Information and Computation
Bounds on the number of knight's tours
Discrete Applied Mathematics
Algebraic decision diagrams and their applications
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Efficient Boolean Manipulation with OBDD's Can be Extended to FBDD's
IEEE Transactions on Computers
Embedding memoization to the semantic tree search for deciding QBFs
AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
Zero-suppressed binary decision diagrams (ZBDDs)have been introduced by Minato [14–17] who presents applications for cubeset representations, fault simulation, timing analysis and the n-queens problem. Here the structural properties of ZBDDs areworked out and a generic synthesis algorithm is presented andanalyzed. It is proved that ZBDDs can be at most by a factorn + 1smaller or larger than ordered BDDs (OBDDs) for the same functionon n variables. Using ZBDDs the best known upper bound on thenumber of knight‘s tours on an 8 × 8 chessboard is improvedsignificantly.