Frontiers of feasible and probabilistic feasible Boolean manipulation with branching programs

This publication has 10 references indexed in Scilit:

• The power of polynomial size Ω-branching programs
  Published by Springer Nature ,2006
• Analysis and manipulation of Boolean functions in terms of decision graphs
  Published by Springer Nature ,1993
• Symbolic Boolean manipulation with ordered binary-decision diagrams
  ACM Computing Surveys, 1992
• Separating the eraser Turing machine classes Le, NLe, co-NLe and Pe
  Theoretical Computer Science, 1991
• Efficient implementation of a BDD package
  Published by Association for Computing Machinery (ACM) ,1990
• Sequential circuit verification using symbolic model checking
  Published by Association for Computing Machinery (ACM) ,1990
• The transduction method-design of logic networks based on permissible functions
  IEEE Transactions on Computers, 1989
• Graph-Based Algorithms for Boolean Function Manipulation
  IEEE Transactions on Computers, 1986
• Two lower bounds for branching programs
  Published by Association for Computing Machinery (ACM) ,1986
• Equivalence of free boolean graphs can be decided probabilistically in polynomial time
  Information Processing Letters, 1980