![](/img/cover-not-exists.png)
[ACM Press the thirty-third annual ACM symposium - Hersonissos, Greece (2001..-..)] Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01 - A read-once branching program lower bound of Ω(2 n/4 ) for integer multiplication using universal hashing
Bollig, Beate, Woelfel, PhilippYear:
2001
Language:
english
DOI:
10.1145/380752.380835
File:
PDF, 150 KB
english, 2001