Chain reduction for binary and zero-suppressed decision diagrams

DOI10.1007/978-3-319-89960-2_5MaRDI QIDQ5919614zbMATH OpenOpenAlexFDO

Authors Randal E. Bryant

Publication date 16 September 2019

Published in Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-319-89960-2_5

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05)

Recommendations

• Chain reduction for binary and zero-suppressed decision diagrams
• Binary decision diagrams with edge-specified reductions
• A reducibility concept for problems defined in terms of ordered binary decision diagrams
• A reducibility concept for problems defined in terms of ordered binary decision diagrams
• On the minimization of (complete) ordered binary decision diagrams
• scientific article; zbMATH DE number 1759447
• A rewriting approach to binary decision diagrams
• Cost-Bounded Binary Decision Diagrams for 0-1 Programming
• On the computational power of binary decision diagram with redundant variables.
• Exact minimization of binary decision diagrams using implicit techniques

Cited in

(5)

• DenseZDD: a compact and fast index for families of sets
• A theoretical and numerical analysis of the worst-case size of reduced ordered binary decision diagrams
• Zero-suppression and computation models
• Chain reduction for binary and zero-suppressed decision diagrams
• Binary decision diagrams with edge-specified reductions

This page was built for publication: Chain reduction for binary and zero-suppressed decision diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919614)