Efficient data structures for Boolean functions

This publication has 30 references indexed in Scilit:

• Symbolic model checking: 1020 States and beyond
  Published by Elsevier ,2004
• The graph of multiplication is equivalent to counting
  Information Processing Letters, 1992
• On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
  IEEE Transactions on Computers, 1991
• Heuristics to compute variable orderings for efficient manipulation of ordered binary decision diagrams
  Published by Association for Computing Machinery (ACM) ,1991
• Using BDDs to verify multipliers
  Published by Association for Computing Machinery (ACM) ,1991
• Binary decision tree test functions
  IEEE Transactions on Computers, 1988
• Graph-Based Algorithms for Boolean Function Manipulation
  IEEE Transactions on Computers, 1986
• Functional Test Generation for Digital Circuits Described Using Binary Decision Diagrams
  IEEE Transactions on Computers, 1986
• Equivalence of free boolean graphs can be decided probabilistically in polynomial time
  Information Processing Letters, 1980
• Binary Decision Diagrams
  IEEE Transactions on Computers, 1978