Ran Raz  Home/Search
Context Related
| wisdom.weizmann.ac.il/~ran...Pmulpar.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wisdom.weizmann.ac.il/~ra...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The "Number on the Forehead" model of multi-party communication complexity was first suggested by Chandra, Furst and Lipton. The best known lower bound, for an explicit function (in this model), is a lower bound of \Omega\Gamma n=2 k ), where n is the size of the input of each player, and k is the number of players (first proved by Babai, Nisan and Szegedy). This lower bound has many applications in complexity theory. Proving a better lower bound, for an explicit function, is a major open... (Update)
Similar documents based on text: More All
0.3: Communication Complexity of Simultaneous Messages - Babai, Gal, Kimmel, Lokam (1999) (Correct)
0.3: Simultaneous Messages vs. Communication - Babai, Gál, Kimmel, Lokam (Correct)
0.3: The BNS Lower Bound for Multi-Party Protocols is Nearly Optimal - Grolmusz (1994) (Correct)
BibTeX entry: (Update)
R. Raz. The BNS-Chung criterion for multi-party communication complexity. Computational Complexity, 9:113--122, 2000. http://citeseer.ist.psu.edu/raz00bnschung.html More
@article{ raz00bnschung,
author = "Ran Raz",
title = "The {BNS}-Chung criterion for multi-party communication complexity",
journal = "Computational Complexity",
volume = "9",
number = "2",
pages = "113-122",
year = "2000",
url = "citeseer.ist.psu.edu/raz00bnschung.html" }
Citations (may not include all citations):197 Cambridge University Press (context) - Kushilevitz, Nisan et al.
166 Some Complexity Questions Related to Distributive Computing (context) - Yao - 1979
68 On ACC and threshold circuits (context) - Yao - 1990
61 Natural Proofs - Razborov, Rudich - 1994
41 Rounds in communication complexity revisited - Nisan, Wigderson - 1993
27 the power of small-depth threshold circuits (context) - Hastad, Goldmann - 1991
25 Multiparty protocols and logspace-hard pseudorandom sequence.. (context) - Babai, Nisan et al. - 1989
9 Communication Complexity and Quasi Randomness (context) - Chung, Tetali - 1993
6 Quasi-Random Classes of Hypergraphs (context) - Chung - 1990
1 Multy-Party Protocols (context) - Chandra, Furst et al. - 1983
Documents on the same site (http://www.wisdom.weizmann.ac.il/~ranraz/./publications/index.html): More
Fourier Analysis For Probabilistic Communication Complexity - Raz (1995) (Correct)
VC-Dimension of Sets of Permutations - Raz (Correct)
On the Distribution of the Number of Roots of Polynomials and.. - Hartman (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC