Abstract
A major goal in complexity theory is to understand the communication complexity of number-on-the-forehead problems f :({0, 1} n ) k → {0, 1} with k > log n parties. We study the problems of inner product and set disjointness and determine their randomized communication complexity for every k ≥ log n , showing in both cases that Θ(1 + ⌈log n ⌉/ log ⌈1 + k / log n ⌉) bits are necessary and sufficient. In particular, these problems admit constant-cost protocols if and only if the number of parties is k ≥ n ϵ for some constant ϵ > 0.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
