Individual communication complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2996, Issue , 2004, Pages 19-30

  Buhrman, Harry ^a   Klauck, Hartmut ^b   Vereshchagin, Nikolai ^c   Vitányi, Paul ^a  

^a CWI   (Netherlands)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

^c MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AVERAGE CASE; COMMUNICATION COMPLEXITY; TWO WAYS;

COMPUTATIONAL COMPLEXITY;

EID: 35048888511     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24749-4_3     Document Type: Article

References (8)

1. C.H. Bennett, P. Gács, M. Li, P.M.B. Vitányi, and W. Zurek, Information Distance, IEEE Trans. Information Theory, IT-44:4(1998) 1407-1423.
2. H. Buhrman, T. Jiang, M. Li, P. Vitanyi, New applications of the incompressibility method: Part II, Theoretical Computer Science, 235:1(2000), 59-70.
3. E. Kushilevitz, N. Nisan, Communication Complexity, Cambridge University Press, 1997.
4. L. A. Levin, Average Case Complete Problems, SIAM J.Comput., 15:1(1986), 285-286.
5. M. Li and P.M.B. Vitányi, An Introduction to Kolmogorov Complexity and its Applications, Springer-Verlag, New York, 2nd Edition, 1997.
6. An.A. Muchnik, Conditional complexity and codes, Theoret. Comput. Sci., 271:1/2(2002), 97-111.
7. N.K. Vereshchagin and P.M.B. Vitányi, Kolmogorov's structure functions and an application to the foundations of model selection, Proc. 47th IEEE Symp. Found. Comput. Sci., 2002, 751-760.
8. A.C. Yao. Some complexity questions related to distributive computing. In: Proc. 11th ACM Symposium on Theory of Computing, 1979, 209-213.