A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication.

Beate Bollig

Browse the full LATIN paper archive.