The Size of Reduced OBDD's and Optimal Read-Once Branching Programs for Almost All Boolean Functions
暂无分享,去创建一个
[1] Sheldon B. Akers,et al. Binary Decision Diagrams , 1978, IEEE Transactions on Computers.
[2] Claude E. Shannon,et al. The synthesis of two-terminal switching circuits , 1949, Bell Syst. Tech. J..
[3] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[4] Ingo Wegener,et al. Graph Driven BDDs - A New Data Structure for Boolean Functions , 1995, Theor. Comput. Sci..
[5] Chen-Shang Lin,et al. On the OBDD-Representation of General Boolean Functions , 1992, IEEE Trans. Computers.
[6] Christoph Meinel,et al. Frontiers of Feasible and Probabilistic Feasible Boolean Manipulation with Branching Programs , 1993, STACS.
[7] Ingo Wegener,et al. The complexity of Boolean functions , 1987 .
[8] Kenneth J. Supowit,et al. Finding the Optimal Variable Ordering for Binary Decision Diagrams , 1990, IEEE Trans. Computers.
[9] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .
[10] Randal E. Bryant,et al. Efficient implementation of a BDD package , 1991, DAC '90.
[11] Randal E. Bryant,et al. On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication , 1991, IEEE Trans. Computers.
[12] J. Spencer. Probabilistic Methods in Combinatorics , 1974 .
[13] Randal E. Bryant,et al. Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.