On the complexity of constructing optimal ordered binary decision diagrams

DOI10.1007/3-540-58338-6_98zbMath1493.68161OpenAlexW1553009378MaRDI QIDQ5096910

Anna Slobodová, Christoph Meinel

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58338-6_98

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items

The complexity of minimizing and learning OBDDs and FBDDs ⋮ ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES ⋮ Unnamed Item ⋮ The nonapproximability of OBDD minimization

Cites Work

• Equivalence of free Boolean graphs can be decided probabilistically in polynomial time
• Modified branching programs and their computational power
• Reduction of OBDDs in linear time
• Graph-Based Algorithms for Boolean Function Manipulation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item