English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  Fooling Pairs in Randomized Communication Complexity

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.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-5A81-1 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-5A85-A
Genre: Journal Article

Files

show Files

Locators

show
hide
Locator:
Link (Any fulltext)
Description:
-
OA-Status:

Creators

show
hide
 Creators:
Moran, Shay1, Author           
Sinha, Makrand2, Author
Yehudayoff, Amir2, Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2014-02-192014-05-05
 Publication Status: Published online
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: DBLP:journals/eccc/MoranSY14
Report Nr.: TR14-022
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Electronic Colloquium on Computational Complexity (ECCC) : Report Series
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Potsdam : Hasso-Plattner-Institut für Softwaretechnik GmbH
Pages: - Volume / Issue: 22 (Revision 1) Sequence Number: - Start / End Page: 1 - 11 Identifier: ISSN: 1433-8092