Combining ordered best-first search with branch and bound for exact BDD minimization. Ebendt, R., Günther, W., & Drechsler, R. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 24(10):1515-1529, 2005.
Combining ordered best-first search with branch and bound for exact BDD minimization. [link]Link  Combining ordered best-first search with branch and bound for exact BDD minimization. [link]Paper  bibtex   
@article{journals/tcad/EbendtGD05,
  added-at = {2020-09-24T00:00:00.000+0200},
  author = {Ebendt, Rüdiger and Günther, Wolfgang and Drechsler, Rolf},
  biburl = {https://www.bibsonomy.org/bibtex/22897ccff22cd8065ee1eceb14f59aec3/dblp},
  ee = {https://www.wikidata.org/entity/Q59242852},
  interhash = {366b51e9b130f9c988a7728d89cb135d},
  intrahash = {2897ccff22cd8065ee1eceb14f59aec3},
  journal = {IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.},
  keywords = {dblp},
  number = 10,
  pages = {1515-1529},
  timestamp = {2020-09-25T11:49:09.000+0200},
  title = {Combining ordered best-first search with branch and bound for exact BDD minimization.},
  url = {http://dblp.uni-trier.de/db/journals/tcad/tcad24.html#EbendtGD05},
  volume = 24,
  year = 2005
}

Downloads: 0