A characterization of average case communication complexity

Information Processing Letters

Volumn 101, Issue 6, 2007, Pages 245-249

  Dietzfelbinger, Martin ^a   Wunderlich, Henning ^a  

^a ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Average case complexity; Communication complexity; Computational complexity; Distributed computing; Information complexity; Theory of computation

Indexed keywords

COMPUTATION THEORY; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION ANALYSIS;

AVERAGE CASE COMPLEXITY; COMMUNICATION COMPLEXITY; CONSTANT FACTORS; INFORMATION COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 33846324756     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.10.006     Document Type: Article

References (10)

1. Ahlswede R., and Cai N. On communication complexity of vector-valued functions. IEEE Transactions on Information Theory 40 6 (1994) 2062-2067
2. Z. Bar-Yossef, T. Jayram, R. Jumar, D. Sivakumar, An information statistics approach to data stream and communication complexity, in: Proc. 43rd Annual IEEE Symp. on Foundations of Computer Science, 2002, pp. 209-218
3. Buhrman H., Jiang T., Li M., and Vitányi P. New applications of the incompressibility method: Part II. Theoretical Computer Science 235 1 (2000) 59-70
4. A. Chakrabarti, Y. Shi, A. Wirth, A.C. Yao, Informational complexity and the direct sum problem for simultaneous message complexity, in: Proc. 12th Annual ACM Symp. on the Theory of Computing, 2001, pp. 270-278
5. Cover T., and Thomas J. Elements of Information Theory. Wiley Series in Telecommunications (1991), John Wiley and Sons
6. Jain R., Radhakrishnan J., and Sen P. A direct sum theorem in communication complexity via message compression. Proc. 30th International Colloquium on Automata, Languages and Programming. ICALP 2003. Lecture Notes in Comput. Sci. vol. 2719 (2003), Springer, Berlin 300-315
7. Kushilevitz E., and Nisan N. Communication Complexity (1997), Cambridge University Press
8. Newman I. Private vs. common random bits in communication complexity. Information Processing Letters 39 2 (1991) 67-71
9. Orlitsky A., and El Gamal A. Average and randomized communication complexity. IEEE Transactions on Information Theory 36 1 (1990) 3-16
10. A.C. Yao, Some complexity questions related to distributed computing, in: Proc. 11th Annual ACM Symp. on the Theory of Computing, 1979, pp. 209-213