BDDs -- design, analysis, complexity, and applications.
From MaRDI portal
Publication:1428568
DOI10.1016/S0166-218X(03)00297-XzbMath1045.94023MaRDI QIDQ1428568
Publication date: 29 March 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
design of algorithmsmodel checkingbinary decision diagramscomplexity classestruth functionsswitching circuits
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Better upper bounds on the QOBDD size of integer multiplication ⋮ Knowledge compilation meets database theory: compiling queries to decision diagrams ⋮ Symbolic graphs: Linear solutions to connectivity related problems ⋮ On the OBDD size for graphs of bounded tree- and clique-width ⋮ An efficient relational deductive system for propositional non-classical logics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the effect of local changes in the variable ordering of ordered decision diagrams
- Graph driven BDDs -- a new data structure for Boolean functions
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs
- Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams
- Reduction of OBDDs in linear time
- Optimal ordered binary decision diagrams for read-once formulas
- Time-space tradeoffs for branching programs
- Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions
- On lower bounds for read-\(k\)-times branching programs
- On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
- Graph-Based Algorithms for Boolean Function Manipulation
- On the complexity of branching programs and decision trees for clique functions
- A Lower Bound for Integer Multiplication with Read-Once Branching Programs
- 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
- Communication Complexity
- A read-once branching program lower bound of Ω(2 n/4 ) for integer multiplication using universal hashing
- Higher-Radix Division Using Estimates of the Divisor and Partial Remainders
This page was built for publication: BDDs -- design, analysis, complexity, and applications.
