论文信息 - Individual Communication Complexity: Extended Abstract

Individual Communication Complexity: Extended 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.

Nikolai K. Vereshchagin | Hartmut Klauck | Harry Buhrman | Paul M. B. Vitányi

[1] Péter Gács,et al. Information Distance , 1998, IEEE Trans. Inf. Theory.

[2] Leonid A. Levin,et al. Average Case Complete Problems , 1986, SIAM J. Comput..

[3] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[4] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[5] Nikolai K. Vereshchagin,et al. Kolmogorov's structure functions and model selection , 2002, IEEE Transactions on Information Theory.

[6] Nikolai K. Vereshchagin,et al. Kolmogorov's structure functions with an application to the foundations of model selection , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[7] William I. Gasarch,et al. Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series)) , 1997, SIGACT News.

[8] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 1997, Texts in Computer Science.

[9] Eyal Kushilevitz,et al. Communication Complexity , 1997, Adv. Comput..

[10] Harry Buhrman,et al. New applications of the incompressibility method: Part II , 1998, Theor. Comput. Sci..

[11] Andrej Muchnik,et al. Conditional complexity and codes , 2002, Theor. Comput. Sci..