Work

Individual Communication Complexity

Year: 2003

Type: conference-paper

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: UvA-DARE (University of Amsterdam)

DOI: 10.48550/arxiv.cs/0304012

Authors: Buhrman, Harry, Klauck, Hartmut, Vereshchagin, Nikolai, Vitanyi, Paul

Institutions: Centrum Wiskunde & Informatica, University of Amsterdam, Goethe University Frankfurt, Institute for Advanced Study, Lomonosov Moscow State University

Language: English

Topic: Computability, Logic, AI Algorithms

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2561045869

FWCI:

Cites:

Cited by:

Related to: 17