Private vs. common random bits in communication complexity (1991) [51 citations — 0 self]
by Ilan Newman
Information Processing Letters
http://cs.haifa.ac.il/ILAN/com-pri.ps
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@ARTICLE{Newman91privatevs.,author = {Ilan Newman},
title = {Private vs. common random bits in communication complexity},
journal = {Information Processing Letters},
year = {1991},
volume = {39},
pages = {67--71}
}
Years of Citing Articles
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 two model are essentially equal.
