On the descriptive and algorithmic power of parity ordered binary decision diagrams

This publication has 12 references indexed in Scilit:

• Separating ⊕L from L, NL, co-NL and AL (=P) for Oblivious turing machines of linear access time
  Published by Springer Nature ,2005
• Mod-2-OBDDs—A data structure that generalizes EXOR-sum-of-products and ordered binary decision diagrams
  Formal Methods in System Design, 1996
• Efficient data structures for Boolean functions
  Discrete Mathematics, 1994
• Reduction of OBDDs in linear time
  Information Processing Letters, 1993
• Symbolic Boolean manipulation with ordered binary-decision diagrams
  ACM Computing Surveys, 1992
• On oblivious branching programs of linear length
  Information and Computation, 1991
• On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
  IEEE Transactions on Computers, 1991
• Lower bounds on the complexity of real-time branching programs
  RAIRO - Theoretical Informatics and Applications, 1988
• 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