A read-once branching program lower bound of ω(2n/4) for integer multiplication using universal hashing

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 419-424

  Bollig, B ^a   Woelfel, P ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Computational complexity; Integer multiplication; Lower bounds; Read once branching programs

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DECISION THEORY; DIGITAL ARITHMETIC; MATHEMATICAL MODELS;

READ-ONCE BRANCHING PROGRAMS (BP1);

COMPUTER PROGRAM LISTINGS; INTEGER PROGRAMMING;

BRANCHING PROGRAMS; COMPUTATION MODEL; EXPONENTIALS; INTEGER MULTIPLICATIONS; LOW BOUND; LOWER BOUND TECHNIQUES; PROGRAM SIZE; READ-ONCE BRANCHING PROGRAMS; REPRESENTATION MODEL; UNIVERSAL HASHING;

EID: 0034819352     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. A non-linear time lower bound for boolean branching programs
2. Two lower bounds for branching programms
3. Linear hash functions
4. Meanders and their applications in lower bound arguments
5. Small pseudo-random sets yield hard functions: New tight explicit lower bounds for branching programs
6. Super-linear time-space tradeoff lower bounds for randomized computation
7. Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication
8. Read-once projections and formal circuit verification with binary decision diagrams
9. Graph-based algorithms for boolean manipulation
10. On the complexity of VLSI implementations and graph representations of boolean functions with application to integer multiplication
11. Universal hashing and k-wise independent random variables via integer arithmetic without primes
12. A reliable randomized algorithm for the closest-pair problem
13. Time-space trade-offs for integer multiplication on various types of input oblivious sequential machines
14. Threshold circuits of bounded depth
15. Lower bounds on the complexity of real-time branching programs
16. A lower bound for integer multiplication with read-once branching programs
17. A lower bound for integer multiplication with read-once branching programs
18. A read-once lower bound and a (1, + k)-hierarchy for branching programs
19. Graph driven BDDs - A new data structure for boolean functions
20. A new lower bound theorem for read-only-once branching programs and its applications
21. An exponential lower bound for one-time-only branching programs
22. On the complexity of branching programs and decision trees for clique functions
23. Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions
24. Efficient strongly universal and optimally universal hashing
25. New bounds on the OBDD-size of integer multiplication via universal hashing