de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Fooling Pairs in Randomized Communication Complexity

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons118057

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

Locator

Link
(Any fulltext)

Fulltext (public)
There are no public fulltexts available
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: http://hdl.handle.net/11858/00-001M-0000-0024-5A81-1
Abstract
There is no abstract available