DocumentCode
3167732
Title
Probabilistic Communication Complexity
Author
Paturi, Ramamohan ; Simon, Janos
Author_Institution
The Pennsylvania State University
fYear
1984
fDate
24-26 Oct 1984
Firstpage
118
Lastpage
126
Keywords
Complexity theory; Computer errors; Computer science; Concatenated codes; Distributed computing; Hamming distance; Power measurement; Probability distribution; Protocols; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1984. 25th Annual Symposium on
ISSN
0272-5428
Print_ISBN
0-8186-0591-X
Type
conf
DOI
10.1109/SFCS.1984.715908
Filename
715908
Link To Document