New results on the complexity of the middle bit of multiplication

Computational Complexity

Volumn 16, Issue 3, 2007, Pages 298-323

  Wegener, Ingo ^a   Woelfel, Philipp ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b UNIVERSITY OF CALGARY   (Canada)

Author keywords

Branching programs; Middle bit; Multiplication; Time space product

Indexed keywords

EID: 38349183852     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-007-0231-z     Document Type: Article

References (13)

1. F. ABLAYEV & M. KARPINSKI (2003). A Lower Bound for Integer Multiplication on Randomized Ordered Read-Once Branching Programs. Information and Computation 186, 78-89.
2. M. AJTAI (1999). A non-linear time lower bound for Boolean branching programs. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, New York City NY, 60-70.
3. P. BEAME, M. SAKS, X. SUN & E. VEE (2003). Time-Space Tradeoff Lower Bounds for Randomized Computation of Decision Problems. Journal of the ACM 50(2), 154-195.
4. n/4) for Integer Multiplication Using Universal Hashing. In Proceedings of the Thirty-third Annual ACM Symposium on the Theory of Computing, Hersonissos, Crete, Greece, 419-424.
5. A. BORODIN, A. RAZBOROV & R. SMOLENSKY (1993). On Lower Bounds for Read-A-Times Branching Programs. Computational Complexity 3, 1-18.
6. M. DIETZFELBINGER (1996). Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without Primes. In 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, volume 1046 of Lecture Notes in Computer Science, 569-580.
7. M. H. HASSOUN (1995). Fundamentals of Artificial Neural Networks. 1st edition. MIT Press, Cambridge, MA, USA. ISBN 026208239X.
8. Y. MANSOUR, N. NISAN & P. TIWARI (1993). The Computational Complexity of Universal Hashing. Theoretical Computer Science 107, 121-133.
9. É. I. NECHIPORUK (1966). A Boolean Function. Soviet Mathematics Doklady 7(4), 999-1000.
10. E. A. OKOL'NISHNIKOVA (1993). On Lower Bounds for Branching Programs. Siberian Advances in Mathematics 3, 152-166.
11. S. PONZIO (1998). A Lower Bound for Integer Multiplication with Read-Once Branching Programs. SIAM Journal on Computing 28, 798-815.
12. M. SAUERHOFF & PH. WOELFEL (2003). Time-Space Tradeoff Lower Bounds for Integer Multiplication and Graphs of Arithmetic Functions. In Proceedings of the Thirty-fifth Annual ACM Symposium on the Theory of Computing, San Diego, CA, USA, 186-195.
13. I. WEGENER, (2000). Branching Programs and Binary Decision Diagrams - Theory and Applications. SIAM, Journal on Computing, Philadelphia. ISBN 0898714583.