Computer Science – Computational Complexity
Scientific paper
2003-04-08
Computer Science
Computational Complexity
11 pages, LaTeX
Scientific paper
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.
Buhrman Harry
Klauck Hartmut
Vereshchagin Nikolai
Vitanyi Paul
No associations
LandOfFree
Individual Communication Complexity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Individual Communication Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Individual Communication Complexity will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-603993