A Read-Once Branching Program Lower Bound of Ω(2^(n/4)) for Integer Multiplication Using Universal Hashing
Beate Bollig and Philipp Woelfel
BibTeX:
@inproceedings{InProc-BW2001a,
author = {Beate Bollig and Philipp Woelfel},
title = {A Read-Once Branching Program Lower Bound of $Ømega(2^n/4)$ for Integer Multiplication Using Universal Hashing},
booktitle = {Proceedings of the 33rd ACM Symposium on Theory of Computing (STOC)},
pages = {419-424},
year = {2001},
doi = {10.1145/380752.380835},
url = {http://dl.acm.org/authorize?11640},
}