Fooling Pairs in Randomized Communication Complexity

Moran, Shay; Sinha, Makrand; Yehudayoff, Amir

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Fooling Pairs in Randomized Communication Complexity

MPS-Authors

/persons/resource/persons118057

Moran, Shay
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

Link
(Any fulltext)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Moran, S., Sinha, M., & Yehudayoff, A. (2014). Fooling Pairs in Randomized Communication Complexity. Electronic Colloquium on Computational Complexity (ECCC): Report Series, 22 (Revision 1), 1-11.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-5A81-1

Abstract

There is no abstract available