Searching for "Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness." – sorted by Relevance.

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

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

1 documents found, showing 1 through 1.

Near-optimal lower bounds on the multi-party communication complexity of set disjointness
by Amit Chakrabarti, Subhash Khot, Xiaodong Sun — 2003 — In IEEE Conference on Computational Complexity
…Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness Amit…
Cited by 31 (2 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB