Detlef Sieling. The Complexity of Minimizing FBDDs. In Miroslaw Kutylowski, Leszek Pacholski, Tomasz Wierzbicki, editors, Mathematical Foundations of Computer Science 1999, 24th International Symposium, MFCS 99, Szklarska Poreba, Poland, September 6-10, 1999, Proceedings. Volume 1672 of Lecture Notes in Computer Science, pages 251-261, Springer, 1999.
@inproceedings{Sieling99,
title = {The Complexity of Minimizing FBDDs},
author = {Detlef Sieling},
year = {1999},
researchr = {https://researchr.org/publication/Sieling99},
cites = {0},
citedby = {0},
pages = {251-261},
booktitle = {Mathematical Foundations of Computer Science 1999, 24th International Symposium, MFCS 99, Szklarska Poreba, Poland, September 6-10, 1999, Proceedings},
editor = {Miroslaw Kutylowski and Leszek Pacholski and Tomasz Wierzbicki},
volume = {1672},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-66408-4},
}