Zero-suppressed BDDs and their applications
From MaRDI portal
Publication:1606803
DOI10.1007/S100090100038zbMath1002.68589OpenAlexW1545320146MaRDI QIDQ1606803
Publication date: 25 July 2002
Published in: International Journal on Software Tools for Technology Transfer. STTT (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2115/16895
Searching and sorting (68P10) Computer science aspects of computer-aided design (68U07) Computing methodologies and applications (68U99)
Related Items (11)
BDD-Based Symbolic Model Checking ⋮ Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations ⋮ Partially-shared zero-suppressed multi-terminal BDDs: Concept, algorithms and applications ⋮ Characteristics of the maximal independent set ZDD ⋮ Exploiting Asymmetry in Logic Puzzles: Using ZDDs for Symbolic Model Checking Dynamic Epistemic Logic ⋮ Constraint-based probabilistic modeling for statistical abduction ⋮ Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. ⋮ Dualization of Boolean functions using ternary decision diagrams ⋮ Extending greedy feature selection algorithms to multiple solutions ⋮ P-Semiflow Computation with Decision Diagrams ⋮ Decision diagrams for solving a job scheduling problem under precedence constraints
This page was built for publication: Zero-suppressed BDDs and their applications
