A linear lower bound on the unbounded error probabilistic communication complexity
Journal of Computer and System Sciences - Complexity 2001
On the Representation of Boolean Predicates of the Diffie-Hellman Function
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Limitations of Learning via Embeddings in Euclidean Half-Spaces
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Classical deterministic complexity of Edmonds' Problem and quantum entanglement
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Limitations of learning via embeddings in euclidean half spaces
The Journal of Machine Learning Research
A simple polynomial-time rescaling algorithm for solving linear programs
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Classical complexity and quantum entanglement
Journal of Computer and System Sciences - Special issue: STOC 2003
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
Learning complexity vs communication complexity
Combinatorics, Probability and Computing
Complexity theoretic aspects of some cryptographic functions
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
| Hi-index | 0.00 |
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. 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.