Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems

@article{Minato1993ZeroSuppressedBF,
  title={Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems},
  author={Shin-ichi Minato},
  journal={30th ACM/IEEE Design Automation Conference},
  year={1993},
  pages={272-277}
}
In this paper, we propose Zero-Suppressed BDDs (0-Sup-BDDs), which are BDDs based on a new reduction rule. This data structure brings unique and compact representation of sets which appear in many combinatorial problems. Using 0-Sup-BDDs, we can manipulate such sets more simply and efficiently than using original BDDs. We show the properties of 0-Sup-BDDs, their manipulation algorithms, and good applications for LSI CAD systems. 

Figures, Tables, and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 434 CITATIONS, ESTIMATED 25% COVERAGE

FILTER CITATIONS BY YEAR

1993
2019

CITATION STATISTICS

  • 84 Highly Influenced Citations

  • Averaged 17 Citations per year over the last 3 years

  • 14% Increase in citations per year in 2018 over 2017

Similar Papers

Loading similar papers…