"Larger Lower Bounds on the OBDD Complexity of Integer Multiplication."

Beate Bollig (2009)
a service of Schloss Dagstuhl - Leibniz Center for Informatics