The Communication Complexity of Threshold Gates (1994)
| Venue: | In Proceedings of “Combinatorics, Paul Erdos is Eighty |
| Citations: | 22 - 1 self |
BibTeX
@INPROCEEDINGS{Nisan94thecommunication,
author = {Noam Nisan},
title = {The Communication Complexity of Threshold Gates},
booktitle = {In Proceedings of “Combinatorics, Paul Erdos is Eighty},
year = {1994},
pages = {301--315}
}
Years of Citing Articles
OpenURL
Abstract
We prove upper bounds on the randomized communication complexity of evaluating a threshold gate (with arbitrary weights). For linear threshold gates this is done in the usual 2 party communication model, and for degree-d threshold gates this is done in the multiparty model. We then use these upper bounds together with known lower bounds for communication complexity in order to give very easy proofs for lower bounds in various models of computation involving threshold gates. This generalizes several known bounds and answers several open problems.







