Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 186-195

  Sauerhoff, Martin ^a   Woelfel, Philipp ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Branching program; Hash class; Integer multiplication; Lower bound; Random access machine; Time space tradeoff

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; GRAPH THEORY;

RANDOM ACCESS MACHINES (RAM);

COMPUTATION THEORY;

EID: 0037770117     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780542.780571     Document Type: Conference Paper

References (25)

1. F. Ablayev and M. Karpinski. A lower bound for integer multiplication on randomized ordered read-once branching programs. In Proc. of 1st CSIT, Electronic Edition, 1999.
2. M. Ajtai. Determinism versus non-determinism for linear time RAMs with memory restrictions. In Proc. of 31st STOC, pages 632-641, 1999.
3. M. Ajtai. A non-linear time lower bound for Boolean branching programs. In Proc. of 40th FOCS, pages 60-70, 1999.
4. P. Beame, T. S. Jayram, and M. Saks. Time-space tradeoffs for branching programs. Journal of Computer and System Sciences, 63(4):542-572, 2001.
5. P. Beame, M. Saks, X. Sun, and E. Vee. Super-linear time-space tradeoff lower bounds for randomized computation. In Proc. of 41st FOCS, pages 169-179, 2000. To appear in Journal of the ACM. See also www.cs.washington.edu/homes/beame/publications.html.
6. P. Beame and E. Vee. Time-space tradeoffs, multiparty communication complexity, and nearest neighbor problems. In Proc. of 34th STOC, pages 688-697, 2002.
7. B. Bollig. Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication. In Proc. of 25th MFCS, volume 1893 of Lecture Notes in Computer Science, pages 222-231. Springer, 2000.
8. B. Bollig, S. Waack, and P. Woelfel. Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication. In Proc. of 2nd TCS, pages 83-94, 2002.
9. n/4) for integer multiplication using universal hashing. In Proc. of 33rd STOC, pages 419-424, 2001.
10. B. Bollig and P. Woelfel. A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications. In Proc. of 27th MFCS, pages 131-142, 2002.
11. A. Borodin and S. Cook. A time-space tradeoff for sorting on a general sequential model of computation. SIAM J. Comp., 11(2):287-297, 1982.
12. A. Borodin, A. A. Razborov, and R. Smolensky. On lower bounds for read-k-times branching programs. Computational Complexity, 3:1-18, 1993.
13. R. E. Bryant. On the complexity of VLSI implementations and graph representations of boolean functions with applications to integer multiplication. IEEE Transactions on Computers, 40(2):205-213, 1991.
14. J. L. Carter and M. N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18(2): 143-154, 1979.
15. M. Dietzfelbinger. Universal hashing and k-wise independent random variables via integer arithmetic without primes. In Proc. of 13th STAGS, pages 569-580, 1996.
16. M. Dietzfelbinger, T. Hagerup, J. Katajainen, and M. Penttonen. A reliable randomized algorithm for the closest-pair problem. Journal of Algorithms, 25:19-51, 1997.
17. J. Gergov. Time-space tradeoffs for integer multiplication on various types of input oblivious sequential machines. Information Processing Letters, 51:265-269, 1994.
18. S. Jukna. The graph of integer multiplication is hard for read-k-times networks. Technical Report 95-10, Universität Trier, 1995. Available under ftp://ftp.informatik.unitrier.de/pub/Users-Root/reports/95-10.ps.
19. Y. Mansour, N. Nisan, and P. Tiwari. The computational complexity of universal hashing. Theoretical Computer Science, 107:121-133, 1993.
20. S. Ponzio. A lower bound for integer multiplication with read-once branching programs. SIAM Journal on Computing, 28:798-815, 1998.
21. I. Wegener. Branching Programs and Binary Decision Diagrams-Theory and Applications. Monographs on Discrete and Applied Mathematics. SIAM, Philadelphia, PA, 2000.
22. M. N. Wegman and J. L. Carter. New classes and applications of hash functions. In Proc. of 20th FOCS, pages 175-182, 1979.
23. P. Woelfel. Efficient strongly universal and optimally universal hashing. In Proc. of 24th MFCS, pages 262-272, 1999.
24. P. Woelfel. New bounds on the OBDD-size of integer multiplication via universal hashing. In Proc. of 18th STACS, pages 563-574, 2001.
25. P. Woelfel. On the complexity of integer multiplication in branching programs with multiple tests and in read-once branching programs with limited nondeterminism. In Proc. of 17th Comp. Compl, pages 80-89, 2002.