Location of Repository

An Exposition of an Upper Bound in Multiparty Communication Complexity

By William Gasarch

Abstract

Def 1.1 Let f: {{0, 1} n} k → X. Assume, for 1 ≤ i ≤ k, Pi has all of the inputs except xi. Let d(f) be the total number of bits broadcast in the optimal deterministic protocol for f. At the end of the protocol all parties must know the answer. This is called the multipart

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.360.2788
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.umd.edu/~gasarch... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.