By Topic

Average and randomized communication complexity

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Orlitsky, A. ; AT&T Bell Lab., Murray Hill, NJ, USA ; El Gamal, A.

The communication complexity of a two-variable function f(x,y) is the number of information bits two communicators need to exchange to compute f when, initially, each knows only one of the variables. There are several communication-complexity measures corresponding to whether (1) the worst case or average number of bits is considered, (2) computation errors are allowed and (3) randomization is allowed. Tight bounds are provided for the typical behavior of all bounded-error communication-complexity measures of Boolean functions. In the present work, the authors formally define the deterministic model. They describe randomized protocols and compare them to deterministic ones. They both survey previous work and describe original results

Published in:

Information Theory, IEEE Transactions on  (Volume:36 ,  Issue: 1 )