On multi-partition communication complexity

Information and Computation

Volumn 194, Issue 1, 2004, Pages 49-75

  Ďuriš, Pavol ^a   Hromkovič, Juraj ^b   Jukna, Stasys ^c   Sauerhoff, Martin ^d   Schnitger, Georg ^e  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b ETH ZURICH   (Switzerland)

^c Inst for Math and Informatics   (Lithuania)

^d TU DORTMUND UNIVERSITY   (Germany)

^e GOETHE UNIVERSITY   (Germany)

Author keywords

Complexity hierarchy; Computational complexity; Lower bounds; Multi partition communication complexity; Non obliviousness; Read once branching programs

Indexed keywords

AUTOMATION; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PROBLEM SOLVING; VECTORS;

COMPLEXITY HIERARCHY; LOWER BOUNDS; NON-OBLIVIOUSNESS; PARTITION COMMUNICATION COMPLEXITIES; READ-ONCE BRANCHING PROGRAMS;

COMMUNICATION;

EID: 4344620745     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2004.05.002     Document Type: Article

References (27)

1. M. Ajtai, A non-linear time lower bound for boolean branching programs, in: Proceedings of 40th FOCS, 1999, pp. 60-70.
2. M. Ajtai, L. Babai, P. Hajnal, J. Komlós, P. Pudlák, V. Rödl, E. Szemerédi, G. Turán, Two lower bounds for branching programs, in: Proceedings of 18th STOC, 1986, pp. 30-38.
3. N. Alon, W. Maass, Meanders and their applications in lower bounds arguments, Journal of Computer and System Sciences 37 (2) (1988) 118-129.
4. P. Beame, T.S. Jayram, M. Saks, Time-space tradeoffs for branching programs, Journal of Computer and System Sciences 63 (4) (2001) 542-572.
5. P. Beame, M. Saks, X. Sun, E. Vee, Time-space trade-off lower bounds for randomized computation of decision problems, Journal of the ACM 50 (2) (2003) 154-195.
6. A. Borodin, A.A. Razborov, R. Smolensky, On lower bounds for read-k-times branching programs, Computational Complexity 3 (1993) 1-18.
7. R. Canetti, O. Goldreich, Bounds on tradeoffs between randomness and communication complexity, Computational Complexity 3 (1993) 141-167.
8. R. Fleischer, H. Jung, K. Mehlhorn, A communication-randomness tradeoff for two-processor systems, Information and Computation 116 (1995) 155-161.
9. J. Hromkovič, Communication Complexity and Parallel Computing. EATCS. Texts in Theoretical Computer Science, Springer, Berlin, 1997.
10. J. Hromkovič, Communication protocols - an exemplary study of the power of randomness, in: S. Rajasekaran, P.M. Pardalos, J.H. Reif, J.D.P. Rolim (Eds.), Handbook on Randomized Computing, Kluwer Academic, Dordrecht, 2001, Chapter 16.
11. J. Hromkovič, M. Sauerhoff, Tradeoffs between nondeterminism and complexity for communication protocols and branching programs, in: Proceedings of 17th STACS, LNCS 1770, Springer, 2000, pp. 145-156.
12. J. Hromkovič, M. Sauerhoff, On the power of nondeterminism and randomness for oblivious branching programs, Theory of Computing Systems 36 (2003) 159-182.
13. S. Jukna. The graph of integer multiplication is hard for read-k-times networks. Technical Report 95-10, Universität Trier, 1995.
14. S. Jukna, A. Razborov, Neither reading few bits twice nor reading illegally helps much, Discrete Applied Mathematics 85 (1998) 223-238.
15. S. Jukna, G. Schnitger, Triangle-freeness is hard to detect, Combinatorics, Probability and Computing 11 (6) (2002) 549-569.
16. E. Kushilevitz, N. Nisan, Communication Complexity, Cambridge University Press, Cambridge, 1997.
17. F.J. MacWilliams, N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1998.
18. S. Micali, Two-way deterministic finite automata are exponentially more succinct than sweeping automata, Information Processing Letters 12 (2) (1981) 103-105.
19. I. Newman, Private vs. common random bits in communication complexity, Information Processing Letters 39 (2) (1991) 67-71.
20. E.A. Okol'nishnikova, On lower bounds for branching programs, Siberian Advances in Mathematics 3 (1) (1993) 152-166.
21. C.H. Papadimitriou, M. Sipser, Communication complexity, Journal of Computer and System Sciences 28 (2) (1984) 260-269.
22. A.A. Razborov, Lower bounds for deterministic and nondeterministic branching programs, in: Proceedings of the 8th FCT, LNCS 529, Springer, Germany, 1991, pp. 47-60.
23. W.J. Sakoda, M. Sipser, Nondeterminism and the size of two way finite automata, in: Proceedings of 10th STOC, 1978, pp. 275-286.
24. M. Sauerhoff, Complexity theoretical results for randomized branching programs, PhD thesis, Univ. Dortmund. Shaker, Aachen, 1999.
25. V. Shoup, New algorithms for finding irreducible polynomials over finite fields, Mathematics of Computation 54 (1990) 435-447.
26. M. Sipser, Lower bounds on the size of sweeping automata, Journal of Computer and System Sciences 21 (2) (1980) 195-202.
27. I. Wegener, Branching Programs and Binary Decision Diagrams - Theory and Applications, Monographs on Discrete and Applied Mathematics, SIAM, Philadelphia, PA, 2000.