The theory of zero-suppressed BDDs and the number of knight's tours

Formal Methods in System Design

Volumn 13, Issue 3, 1998, Pages 235-253

  Schröer, Olaf ^a   Wegener, Ingo ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Decomposition rules; Generic synthesis algorithm; Knight's problem; Ordered binary decision diagram; Trade offs; Zero suppressed binary decision diagram

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; FAULT TOLERANT COMPUTER SYSTEMS; SET THEORY; FUNCTIONS;

DECOMPOSITION RULES; GENERIC SYNTHESIS ALGORITHMS; KNIGHT'S PROBLEM; ORDERED BINARY DECISION DIAGRAMS (OBDD); TRADE-OFFS; ZERO-SUPRESSED BINARY DECISION DIAGRAM (ZBDD); GENERIC SYNTHESIS ALGORITHM; ORDERED BINARY DECISION DIAGRAM; QUEEN'S PROBLEM; ZERO-SUPPRESSED BINARY DECISION DIAGRAM;

DECISION THEORY;

EID: 0032208271     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008681625346     Document Type: Article

References (21)

1. R.I. Bahar, E.A. Frohm, C.M. Gaona, G.D. Hachtel, E. Macii, A. Pardo, and F. Somenzi, "Algebraic decision diagrams and their applications," in Proc. IEEE Int. Conf. on Computer-Aided Design ICCAD, pp. 188-191, 1993.
2. B. Becker, R. Drechsler, and R. Werchner, "On the relation between HDDs and FDDs," Information and Computation, Vol. 123, pp. 185-197, 1995.
3. K.S. Brace, R.L. Rudell, and R.E. Bryant, "Efficient implementation of a BDD package," in Proc. 27. ACM/IEEE Design Automation Conference, pp. 40-45, 1990.
4. R.E. Bryant, "Graph-based algorithms for Boolean function manipulation," IEEE Trans. on Computers, Vol. 35, pp. 677-691, 1986.
5. R.E. Bryant and Y.-A. Chen, "Verification of arithmetic functions with binary moment diagrams," in Proc. Design Automation Conf. DAC, pp. 535-541, 1995.
6. A. Conrad, T. Hindrichs, H. Morsy, and I. Wegener, "Solution of the knight's Hamiltonian path problem on chessboards," Discrete Applied Mathematics, Vol. 50, pp. 125-134, 1994.
7. J. Gergov and Ch Meinel, "Efficient analysis and manipulation of OBDDs can be extended to FBDDs," IEEE Trans, on Computers, Vol. 43, pp. 1197-1209, 1994.
8. J. Jain, M. Abadir, J. Bitner, D.S. Fussell, and J.A. Abraham, "IBDDs: An efficient functional representation for digital circuits," in Proc. European Design Automation Conference EDAC, pp. 440-446, 1992.
9. S.-W. Jeong, B. Plessier, G. Hachtel, and F. Somenzi, "Extended BDDs: Trading off canonicity for structure in verification algorithms," in Proc. IEEE Int. Conf. on Computer-Aided Design ICCAD, pp. 464-467, 1991.
10. U. Kebschull, E. Schubert, and W. Rosenstiel, "Multilevel logic synthesis based on functional decision diagrams," in Proc. European Design Automation Conference EDAC, pp. 43-47, 1992.
11. O. Kyek, I. Parberry, and I. Wegener, "Bounds on the number of knight's tours" Discrete Applied Mathematics, Vol. 74, pp. 171-181, 1997.
12. Y.-T. Lai and S. Sastry, "Edge-valued binary decision diagrams for multi-level hierachical verification," in Proc. 29. Design Automation Conf., pp. 608-613, 1992.
13. H.-T. Liaw and C.-S. Lin, "On the OBDD representation of general Boolean functions," IEEE Trans. on Computers, Vol. 41, pp. 661-664, 1992.
14. S. Minato, "Fast generation of irredundant sum-of-products forms from binary decision diagrams," in Proc. Synthesis and System Integration of Mixed Technologies SASIMI, pp. 64-73, 1992.
15. S. Minato, "Fast weak-division method for implicit cube representation," in Proc. Synthesis and System Integration of Mixed Technologies SASIMI, pp. 423-432, 1993.
16. S. Minato, "Zero-suppressed BDDs for set manipulation in combinatorial problems," in Proc. 30. Design Automation Conference, pp. 272-277, 1993.
17. S. Minato, "Calculation of unate cube set algebra using zero-suppressed BDDs," in Proc. 31. Design Automation Conference, pp. 420-424, 1994.
18. S. Minato, N. Ishiura, and S. Yajima, "Shared binary decision diagrams with attributed edges for efficient Boolean function manipulation," in Proc. 27. Design Automation Conference, pp. 52-57, 1990.
19. D. Sieling and I. Wegener, "Reduction of OBDDs in linear time, " Information Processing Letters, Vol. 48, pp. 139-144, 1993.
20. D. Sieling and I. Wegener, "Graph driven BDDs - A new data structure for Boolean functions," Theoretical Computer Science, Vol. 141, pp. 283-310, 1995.
21. I. Wegener, "The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions," IEEE Trans. on Computers, Vol. 43, No. 11, pp. 1262-1269, 1994.