Ordered binary decision diagrams and the Shannon effect
From MaRDI portal
Publication:1878402
DOI10.1016/j.dam.2003.02.003zbMath1062.94075OpenAlexW2031729686MaRDI QIDQ1878402
Clemens Gröpl, Anand Srivastav, Hans Jürgen Prömel
Publication date: 19 August 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2003.02.003
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Implementing semantic merging operators using binary decision diagrams ⋮ A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the size of binary decision diagrams representing Boolean functions
- The tail of the hypergeometric distribution
- On the evolution of the worst-case OBDD size
- The nonapproximability of OBDD minimization
- On the relation between BDDs and FDDs
- On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
- Graph-Based Algorithms for Boolean Function Manipulation
- Two-level logic minimization: an overview
- The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions
- Least upper bounds on OBDD sizes
- Fast OFDD-based minimization of fixed polarity Reed-Muller expressions
- OKFDDs versus OBDDs and OFDDs
- Balls and bins: A study in negative dependence
- Tail bounds for occupancy and the satisfiability threshold conjecture
- On the OBDD-representation of general Boolean functions
This page was built for publication: Ordered binary decision diagrams and the Shannon effect
