Probabilistic construction and manipulation of Free Boolean Diagrams

This publication has 10 references indexed in Scilit:

• Logic verification using binary decision diagrams in a logic synthesis environment
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• Sequential circuit design using synthesis and optimization
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• Dynamic variable ordering for ordered binary decision diagrams
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Efficient implementation of a BDD package
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Comparing two-level and ordered binary decision diagram representations of logic functions
  IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1993
• Probabilistic verification of Boolean functions
  Formal Methods in System Design, 1992
• On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
  IEEE Transactions on Computers, 1991
• Graph-Based Algorithms for Boolean Function Manipulation
  IEEE Transactions on Computers, 1986
• Equivalence of free boolean graphs can be decided probabilistically in polynomial time
  Information Processing Letters, 1980
• The complexity of equivalence and containment for free single variable program schemes
  Published by Springer Nature ,1978