Probabilistic construction and manipulation of Free Boolean Diagrams
暂无分享,去创建一个
[1] Erik Meineche Schmidt,et al. The Complexity of Equivalence and Containment for Free Single Variable Program Schemes , 1978, ICALP.
[2] Srinivas Devadas. Comparing two-level and ordered binary decision diagram representations of logic functions , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[3] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[4] Albert R. Wang,et al. Logic verification using binary decision diagrams in a logic synthesis environment , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.
[5] 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.
[6] Jacob A. Abraham,et al. Probabilistic verification of Boolean functions , 1992, Formal Methods Syst. Des..
[7] Manuel Blum,et al. Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time , 1980, Inf. Process. Lett..
[8] R. Bryant,et al. Efficient implementation of a BDD package , 1990, 27th ACM/IEEE Design Automation Conference.
[9] Robert K. Brayton,et al. Sequential circuit design using synthesis and optimization , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.