Abstract
We consider some communication complexity problems which arise when proving lower bounds on the complexity of Boolean functions. In particular, we prove an (Formula presented) upper bound on 3-party communication complexity of shifts, an O(ne) upper bound on the multiparty communication complexity of shifts for a polylogarithmic number of parties. These bounds are all significant improvements over ones recently considered “unexpected” by Pudlak [5].
Cite
CITATION STYLE
Ambainis, A. (1996). Upper bounds on multiparty communication complexity of shifts. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1046, pp. 631–642). Springer Verlag. https://doi.org/10.1007/3-540-60922-9_51
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
