DocumentCode
3242859
Title
A linear lower bound on the unbounded error probabilistic communication complexity
Author
Forster, JÜrgen
Author_Institution
Lehrstuhl Math. & Inf., Ruhr-Univ., Bochum, Germany
fYear
2001
fDate
2001
Firstpage
100
Lastpage
106
Abstract
We prove a general lower bound on the complexity of unbounded error probabilistic communication protocols. This result improves on a lower bound for bounded error protocols from Krause (1996). As a simple consequence we get the, to our knowledge, first linear lower bound on the complexity of unbounded error probabilistic communication protocols for the functions defined by Hadamard matrices. We also give an upper bound on the margin of any embedding of a concept class in half spaces
Keywords
Hadamard matrices; communication complexity; probability; protocols; Hadamard matrices; bounded error protocols; communication complexity; linear lower bound; unbounded error probabilistic communication protocols; Complexity theory; Distributed computing; Ear; Error correction; Error correction codes; Kernel; Probability; Protocols; Upper bound; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Complexity, 16th Annual IEEE Conference on, 2001.
Conference_Location
Chicago, IL
Print_ISBN
0-7695-1053-1
Type
conf
DOI
10.1109/CCC.2001.933877
Filename
933877
Link To Document