Minimization problems for parity OBDDs
From MaRDI portal
Publication:2272213
DOI10.1007/s00224-007-9084-8zbMath1173.68018MaRDI QIDQ2272213
Publication date: 6 August 2009
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-007-9084-8
68P05: Data structures
Cites Work
- Graph driven BDDs -- a new data structure for Boolean functions
- Reduction of OBDDs in linear time
- The complexity of minimizing and learning OBDDs and FBDDs
- On the descriptive and algorithmic power of parity ordered binary decision diagrams
- The nonapproximability of OBDD minimization
- A threshold of ln n for approximating set cover
- Graph-Based Algorithms for Boolean Function Manipulation
- Efficient Boolean manipulation with OBDD's can be extended to FBDD's
- Improving the variable ordering of OBDDs is NP-complete
- Branching Programs and Binary Decision Diagrams
- Some optimal inapproximability results
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item