Title :
Determining how much info Bob and Alice really need to communicate
Author :
Capponi, Agostino
Author_Institution :
Dept. of Comput. Sci., California Inst. of Technol., Pasadena, CA, USA
Abstract :
This paper describes the two-party communication complexity model. Each message is a string of bits and carried out according to some fixed protocol. Cost of information transfer associated with a given distributed computation is focused in this paper. This paper also presents an overview of basic algebraic and combinatorial tools that has been used in this theory.
Keywords :
combinatorial mathematics; communication complexity; protocols; algebraic tool; bit string; combinatorial tool; distributed computation; protocol; two-party communication complexity model; Boolean functions; Complexity theory; Protocols;
Journal_Title :
Potentials, IEEE
DOI :
10.1109/MP.2004.1343229
