Private vs. common random bits in communication complexity

Ilan Newman

doi:10.1016/0020-0190(91)90157-D

Private vs. common random bits in communication complexity

Ilan Newman

Research output: Contribution to journal › Article › peer-review

Abstract

We investigate the relative power of the common random string model vs. the private random string model in communication complexity. We show that the models are essentially equal.

Original language	English
Pages (from-to)	67-71
Number of pages	5
Journal	Information Processing Letters
Volume	39
Issue number	2
DOIs	https://doi.org/10.1016/0020-0190(91)90157-D
State	Published - 31 Jul 1991
Externally published	Yes

Keywords

Theory of computation
communication complexity
randomness

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/0020-0190(91)90157-D

Cite this

@article{615c868afaee4f008860d550aa6e7f2f,

title = "Private vs. common random bits in communication complexity",

abstract = "We investigate the relative power of the common random string model vs. the private random string model in communication complexity. We show that the models are essentially equal.",

keywords = "Theory of computation, communication complexity, randomness",

author = "Ilan Newman",

year = "1991",

month = jul,

day = "31",

doi = "10.1016/0020-0190(91)90157-D",

language = "English",

volume = "39",

pages = "67--71",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Private vs. common random bits in communication complexity

AU - Newman, Ilan

PY - 1991/7/31

Y1 - 1991/7/31

N2 - We investigate the relative power of the common random string model vs. the private random string model in communication complexity. We show that the models are essentially equal.

AB - We investigate the relative power of the common random string model vs. the private random string model in communication complexity. We show that the models are essentially equal.

KW - Theory of computation

KW - communication complexity

KW - randomness

UR - https://www.scopus.com/pages/publications/0026187604

U2 - 10.1016/0020-0190(91)90157-D

DO - 10.1016/0020-0190(91)90157-D

M3 - Article

AN - SCOPUS:0026187604

SN - 0020-0190

VL - 39

SP - 67

EP - 71

JO - Information Processing Letters

JF - Information Processing Letters

IS - 2

ER -

Private vs. common random bits in communication complexity

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this