Abstract
We initiate the theory of communication complexity of individual inputs held by the agents, rather than worst-case or average-case. We consider total, partial, and partially correct protocols, one-way versus two-way, with (not in this version) and without help bits.
Keywords
- Identity Function
- Communication Complexity
- Kolmogorov Complexity
- Correct Protocol
- Conditional Complexity
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
The authors are partially supported by EU project QAIP, IST–1999–11234, EU project RESQ, IST-2001-37559, the NoE QUIPROCONE IST–1999–29064, the ESF QiT Programmme, the EU NeuroCOLT II Working Group EP 27150, the EU NoE PASCAL, and by the Netherlands Organization for Scientific Research (NWO).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bennett, C.H., Gács, P., Li, M., Vitányi, P.M.B., Zurek, W.: Information Distance. IEEE Trans. Information Theory IT-44(4), 1407–1423 (1998)
Buhrman, H., Jiang, T., Li, M., Vitanyi, P.: New applications of the incompressibility method: Part II. Theoretical Computer Science 235(1), 59–70 (2000)
Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)
Levin, L.A.: Average Case Complete Problems. SIAM J. Comput. 15(1), 285–286 (1986)
Li, M., Vitányi, P.M.B.: An Introduction to Kolmogorov Complexity and its Applications, 2nd edn. Springer, New York (1997)
Muchnik, A.A.: Conditional complexity and codes. Theoret. Comput. Sci. 271(1/2), 97–111 (2002)
Vereshchagin, N.K., Vitányi, P.M.B.: Kolmogorov’s structure functions and an application to the foundations of model selection. In: Proc. 47th IEEE Symp. Found. Comput. Sci., pp. 751–760 (2002)
Yao, A.C.: Some complexity questions related to distributive computing. In: Proc. 11th ACM Symposium on Theory of Computing, pp. 209–213 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buhrman, H., Klauck, H., Vereshchagin, N., Vitányi, P. (2004). Individual Communication Complexity. In: Diekert, V., Habib, M. (eds) STACS 2004. STACS 2004. Lecture Notes in Computer Science, vol 2996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24749-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-24749-4_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21236-2
Online ISBN: 978-3-540-24749-4
eBook Packages: Springer Book Archive