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

DOI10.1006/inco.2000.3022zbMath1003.68049OpenAlexW2038757167MaRDI QIDQ1854421

Stephan Waack

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2000.3022

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs, Minimization problems for parity OBDDs, Lower bounds for restricted read-once parity branching programs

Cites Work

• On the size of binary decision diagrams representing Boolean functions
• Matrix multiplication via arithmetic progressions
• Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams
• Reduction of OBDDs in linear time
• Efficient data structures for Boolean functions
• On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
• Graph-Based Algorithms for Boolean Function Manipulation
• Unnamed Item