The Theory of Zero-Suppressed BDDs and the Number of Knight's Tours

Zero-suppressed binary decision diagrams (ZBDDs) have been introduced by Minato [14–17] who presents applications for cube set representations, fault simulation, timing analysis and the n-queens problem. Here the structural properties of ZBDDs are worked out and a generic synthesis algorithm is presented and analyzed. It is proved that ZBDDs can be at most by a factor n + 1 smaller or larger than ordered BDDs (OBDDs) for the same function on n variables. Using ZBDDs the best known upper bound on the number of knight's tours on an 8 × 8 chessboard is improved significantly.

[1]  Ingo Wegener,et al.  Graph Driven BDDs - A New Data Structure for Boolean Functions , 1995, Theor. Comput. Sci..

[2]  Chen-Shang Lin,et al.  On the OBDD-Representation of General Boolean Functions , 1992, IEEE Trans. Computers.

[3]  Randal E. Bryant,et al.  Verification of Arithmetic Circuits with Binary Moment Diagrams , 1995, 32nd Design Automation Conference.

[4]  Shin-ichi Minato,et al.  Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems , 1993, 30th ACM/IEEE Design Automation Conference.

[5]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[6]  Ingo Wegener,et al.  Reduction of OBDDs in Linear Time , 1993, Inf. Process. Lett..

[7]  Jacob A. Abraham,et al.  IBDDs: an efficient functional representation for digital circuits , 1992, [1992] Proceedings The European Conference on Design Automation.

[8]  Wolfgang Rosenstiel,et al.  Multilevel logic synthesis based on functional decision diagrams , 1992, [1992] Proceedings The European Conference on Design Automation.

[9]  Yung-Te Lai,et al.  Edge-valued binary decision diagrams for multi-level hierarchical verification , 1992, DAC '92.

[10]  Ingo Wegener,et al.  Bounds on the Number of Knight's Tours , 1997, Discret. Appl. Math..

[11]  Ingo Wegener,et al.  Solution of the knight's Hamiltonian path problem on chessboards , 1994, Discret. Appl. Math..

[12]  Fabio Somenzi,et al.  Extended BDDs: Trading of canonicity for structure in verification algorithms , 1991, Formal Methods Syst. Des..

[13]  Ingo Wegener.  The Size of Reduced OBDD's and Optimal Read-Once Branching Programs for Almost All Boolean Functions , 1994, IEEE Trans. Computers.

[14]  Rolf Drechsler,et al.  On the Relation between BDDs and FDDs , 1995, Inf. Comput..

[15]  Randal E. Bryant,et al.  Efficient implementation of a BDD package , 1991, DAC '90.

[16]  Ingo Wegener.  The Size of Reduced OBDDs and Optimal Read-once Branching Programs for Almost all Boolean Functions , 1993, WG.

[17]  Enrico Macii,et al.  Algebraic decision diagrams and their applications , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[18]  Nagisa Ishiura,et al.  Shared binary decision diagram with attributed edges for efficient Boolean function manipulation , 1990, 27th ACM/IEEE Design Automation Conference.

[19]  R. Bryant,et al.  Verification of Arithmetic Functions with Binary Moment Diagrams , 1994 .

[20]  Shin-ichi Minato.  Calculation of Unate Cube Set Algebra Using Zero-Suppressed BDDs , 1994, 31st Design Automation Conference.

[21]  R. I. Bahar,et al.  Algebraic decision diagrams and their applications , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[22]  Christoph Meinel,et al.  Efficient Boolean Manipulation With OBDD's can be Extended to FBDD's , 1994, IEEE Trans. Computers.