Beate Bollig. A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication. In Alejandro López-Ortiz, editor, LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings. Volume 6034 of Lecture Notes in Computer Science, pages 255-266, Springer, 2010. [doi]
@inproceedings{Bollig10-1,
title = {A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication},
author = {Beate Bollig},
year = {2010},
doi = {10.1007/978-3-642-12200-2_24},
url = {http://dx.doi.org/10.1007/978-3-642-12200-2_24},
researchr = {https://researchr.org/publication/Bollig10-1},
cites = {0},
citedby = {0},
pages = {255-266},
booktitle = {LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings},
editor = {Alejandro López-Ortiz},
volume = {6034},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-12199-9},
}