| | |
| | |
Stat |
Members: 3643 Articles: 2'488'730 Articles rated: 2609
29 March 2024 |
|
| | | |
|
Article overview
| |
|
Individual Communication Complexity | Harry Buhrman
; Hartmut Klauck
; Nikolai Vereshchagin
; Paul Vitanyi
; | Date: |
8 Apr 2003 | Subject: | Computational Complexity; Distributed, Parallel, and Cluster Computing ACM-class: F.1; F.2 | cs.CC cs.DC | Affiliation: | CWI and University of Amsterdam), Hartmut Klauck (IAS, Princeton), Nikolai Vereshchagin (Moscow University), Paul Vitanyi (CWI and University of Amsterdam | 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. | Source: | arXiv, cs.CC/0304012 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |