Lower Bounds for One-way Probabilistic Communication Complexity (1992)
| Citations: | 25 - 2 self |
BibTeX
@MISC{Ablayev92lowerbounds,
author = {F. Ablayev and V. K. Prasana Kumar and J. Simon and Information Transfer Under},
title = {Lower Bounds for One-way Probabilistic Communication Complexity},
year = {1992}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper can be generalized to the optimal model? 8 Acknowledgment I wish to thank L. Hemachandra for his invitation to me to spend the spring semester at the University of Rochester and for his permanent attention to my research and helpfulness in all my problems and J. Seiferas for extensive comments on an earlier draft of this paper. The results of section 4.1 of the paper are the realization of J. Seiferas's advice to investigate the probabilistic complexity properties of almost all functions in comparison with Yao's [Y1] results. I wish also to thank P. Dietz for his comments, which helped to simplify the proof of lemma 4.1
