Mod-2-OBDDs—A data structure that generalizes EXOR-sum-of-products and ordered binary decision diagrams

This publication has 22 references indexed in Scilit:

• Efficient Boolean manipulation with OBDD's can be extended to FBDD's
  IEEE Transactions on Computers, 1994
• Frontiers of feasible and probabilistic feasible Boolean manipulation with branching programs
  Published by Springer Nature ,1993
• Symbolic Boolean manipulation with ordered binary-decision diagrams
  ACM Computing Surveys, 1992
• Probabilistic verification of Boolean functions
  Formal Methods in System Design, 1992
• Synthesis for testability: Binary Decision Diagrams
  Published by Springer Nature ,1992
• On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
  IEEE Transactions on Computers, 1991
• On the complexity of mod-2l sum PLA's
  IEEE Transactions on Computers, 1990
• Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
  Mathematical Notes, 1987
• 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