Data structures for Boolean functions. BDDs -- foundations and applications.
From MaRDI portal
Recommendations
- Graph driven BDDs -- a new data structure for Boolean functions
- scientific article; zbMATH DE number 5852793
- BDD-based Boolean functional synthesis
- Boolean function complexity. Advances and frontiers.
- scientific article; zbMATH DE number 5866337
- Boolean functional synthesis: hardness and practical algorithms
Cited in
(14)- BDDs -- design, analysis, complexity, and applications.
- Ordered binary decision diagrams as knowledge-bases
- On the error resilience of ordered binary decision diagrams
- A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm
- New aspects in optimization of BDDs: mixed techniques based on polulations of solutions and lower bound
- Worst case examples for operations on OBDDs
- Binary decision diagrams
- scientific article; zbMATH DE number 1156875 (Why is no real title available?)
- Ordered binary decision diagrams as knowledge-bases
- A reordering operation for an ordered binary decision diagram and an extended framework for combinatorics of graphs
- On the relation between BDDs and FDDs (extended abstract)
- Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems
- String-matching with OBDDs
- Graph driven BDDs -- a new data structure for Boolean functions
This page was built for publication: Data structures for Boolean functions. BDDs -- foundations and applications.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542178)
