Analysis and manipulation of Boolean functions in terms of decision graphs

This publication has 14 references indexed in Scilit:

• Sequential circuit verification using symbolic model checking
  Published by Association for Computing Machinery (ACM) ,1990
• On oblivious branching programs of linear length
  Lecture Notes in Computer Science, 1989
• The transduction method-design of logic networks based on permissible functions
  IEEE Transactions on Computers, 1989
• On the complexity of branching programs and decision trees for clique functions
  Journal of the ACM, 1988
• Graph-Based Algorithms for Boolean Function Manipulation
  IEEE Transactions on Computers, 1986
• Simulation of MOS Circuits by Decision Diagrams
  IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
• Decision Trees and Diagrams
  ACM Computing Surveys, 1982
• Equivalence of free boolean graphs can be decided probabilistically in polynomial time
  Information Processing Letters, 1980
• Binary Decision Diagrams
  IEEE Transactions on Computers, 1978
• Representation of Switching Circuits by Binary-Decision Programs
  Bell System Technical Journal, 1959