Science-advisor
REGISTER info/FAQ
Login
username
password
     
forgot password?
register here
 
Research articles
  search articles
  reviews guidelines
  reviews
  articles index
My Pages
my alerts
  my messages
  my reviews
  my favorites
 
 
Stat
Members: 3643
Articles: 2'488'730
Articles rated: 2609

29 March 2024
 
  » arxiv » cs.CC/0304012

 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
AffiliationCWI and University of Amsterdam), Hartmut Klauck (IAS, Princeton), Nikolai Vereshchagin (Moscow University), Paul Vitanyi (CWI and University of Amsterdam
AbstractWe 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   
 
Visitor rating: did you like this article? no 1   2   3   4   5   yes

No review found.
 Did you like this article?

This article or document is ...
important:
of broad interest:
readable:
new:
correct:
Global appreciation:

  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






ScienXe.org
» my Online CV
» Free


News, job offers and information for researchers and scientists:
home  |  contact  |  terms of use  |  sitemap
Copyright © 2005-2024 - Scimetrica