Recommendations
Cites work
- Efficient Boolean manipulation with OBDD's can be extended to FBDD's
- Graph driven BDDs -- a new data structure for Boolean functions
- Graph-Based Algorithms for Boolean Function Manipulation
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1142303 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- scientific article; zbMATH DE number 846270 (Why is no real title available?)
- On the complexity of branching programs and decision trees for clique functions
Cited in
(6)- Bypassing BDD construction for reliability analysis
- Verification of arithmetic circuits using binary moment diagrams
- Formal verification based on Boolean expression diagrams
- scientific article; zbMATH DE number 1701749 (Why is no real title available?)
- A Subatomic Proof System for Decision Trees
- Deciding effectively propositional logic using DPLL and substitution sets
This page was built for publication: Boolean expression diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2506489)