Individual Communication Complexity
Computational Complexity
2007-05-23 v1 Distributed, Parallel, and Cluster Computing
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 and without help bits. The results are expressed in trems of Kolmogorov complexity.
Cite
@article{arxiv.cs/0304012,
title = {Individual Communication Complexity},
author = {Harry Buhrman and Hartmut Klauck and Nikolai Vereshchagin and Paul Vitanyi},
journal= {arXiv preprint arXiv:cs/0304012},
year = {2007}
}
Comments
11 pages, LaTeX