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]
Abstract is missing.