A lower bound for integer multiplication on randomized ordered read-once branching programs

Information and Computation

Volumn 186, Issue 1, 2003, Pages 78-89

  Ablayev, Farid ^a,b   Karpinski, Marek ^b  

^a MAX PLANCK INSTITUT FÜR MATHEMATIK   (Germany)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

Complexity; Deterministic and randomized branching programs; Integer multiplication; Lower bounds; OBDD; Randomized algorithms

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; SET THEORY; THEOREM PROVING;

INTEGER MULTIPLICATION;

INTEGER PROGRAMMING;

EID: 0141528467     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00118-4     Document Type: Article

References (20)

1. F. Ablayev, Lower bounds for one-way probabilistic communication complexity, in: Proceedings of the ICALP'93, Lecture Notes in Computer Science, vol. 700, Springer, Berlin, 1993, pp. 241-252.
2. F. Ablayev, Randomization and nondeterminism are incomparable for ordered read-once branching programs, in: Proceedings of the ICALP'97, Lecture Notes in Computer Science, vol. 1256, Springer, Berlin, 1997, pp. 195-202.
3. F. Ablayev, M. Karpinski, On the power of randomized ordered branching programs, Research Report 85181-CS, University of Bonn, 1997.
4. A. Borodin, A. Razborov, R. Smolensky, On lower bounds for read-fc-times branching programs, Comput. Complex. 3 (1993) 1-18.
5. R. Bryant, Graph-based algorithms for boolean function manipulation, IEEE Trans. Comput. C-35 (8) (1986) 677-691.
6. R. Bryant, On the complexity of VLSI implementations and graph representations of Boolean functions with applications to integer multiplication, IEEE Trans. Comput. 40 (2) (1991) 205-213.
7. R. Bryant, Symbolic boolean manipulation with ordered binary decision diagrams, ACM Comput. Surv. 24 (3) (1992) 293-318.
8. R. Buss, The graph of multiplication is equivalent to counting, Inf. Process. Lett. 41 (1992) 199-201.
9. J. Gergov, Time-space tradeoffs for integer multiplication on various types of input oblivious sequential machines, Inf. Process. Lett. 51 (1994) 265-269.
10. S. Jukna, The graph of integer multiplication is hard for read-k-times networks, TR 95-10 Mathematik/Informatik University of Trier, 1995.
11. J. Hromkovic, Communication Complexity and Parallel Computing, EATCS Series, Springer, Berlin, 1997.
12. E. Kushilevitz, N. Nisan, Communication Complexity, Cambridge University Press, 1997.
13. S. Ponzio, A lower bound for integer multiplication with read-once branching programs, in: Proceedings of the 27-th STOC, 1995, pp. 130-139.
14. S. Ponzio, Restricted branching programs and hardware verification, Technical Report, MIT/LCS-TR-633, MIT, 1995.
15. A. Razborov, Lower bounds for deterministic and nondeterministic branching programs, in: Proceedings of the FCT91, Lecture Notes in Computer Science, vol. 529, Springer, Berlin, 1991, pp. 47-60.
16. P. Savicky, S. Zak, A large lower bound for 1-branching programs, Electronic Colloquium on Computational Complexity, Revision 01 of TR96-036 (1996). Available From http://www.eccc.uni-trier.de/eccc/.
17. I. Wegener, Efficient data structure for Boolean functions, Discrete Math. 136 (1994) 347-372.
18. I. Wegener, Branching programs and binary decision diagrams. Theory and applications, SIAM Monographs on Discrete Mathematics and Applications, 2000.
19. A.C. Yao, Some complexity questions related to distributive computing, in: Proceedings of the 11th Annual ACM Symposium on the Theory of Computing 1979, pp. 209-213.
20. A.C. Yao, Lower bounds by probabilistic arguments, in: Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, 1983, pp. 420-428.