MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Multiparty Communication Complexity of Disjointness." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

4 documents found, showing 1 through 4.

ATOM

Multiparty communication complexity of disjointness
by Arkadev Chattopadhyay, Anil Ada — 2008 — In Electronic Colloquium on Computational Complexity (ECCC
…Multiparty Communication Complexity of Disjointness � We obtain a lower bound of Ω Arkadev…
Cited by 4 (0 self) – Add To MetaCart

A strong direct product theorem for corruption and the multiparty communication complexity
by Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson — Computational Complexity
…A STRONG DIRECT PRODUCT THEOREM FOR CORRUPTION AND THE MULTIPARTY COMMUNICATION COMPLEXITY…
Cited by 2 (1 self) – Add To MetaCart

The pattern matrix method for lower bounds on quantum communication
by Alexander A. Sherstov — 2007 — In Proc. of the 40th Symposium on Theory of Computing (STOC
… on the multiparty communication complexity of disjointness for up to o(log log n) players. In a different work…
Cited by 13 (5 self) – Add To MetaCart

Separating AC 0 from depth-2 majority circuits
by Alexander A. Sherstov — 2007 — In Proc. of the 39th Symposium on Theory of Computing (STOC
… in that work. The Degree/Discrepancy Theorem has also found applications to multiparty communication complexity…
Cited by 18 (10 self) – Add To MetaCart

Showing 1 through 4.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB