A linear lower bound on the unbounded error probabilistic communication complexity
Author:
- Jürgen ForsterJFJürgen Forster
- 1 December 2002
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 65 (4) , 612-625
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity2001
- Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces2001
- Limitations of Learning via Embeddings in Euclidean Half-Spaces2001
- Geometric arguments yield better bounds for threshold circuits and distributed computingTheoretical Computer Science, 1996
- Probabilistic communication complexityJournal of Computer and System Sciences, 1986
- Geometrical realization of set systems and probabilistic communication complexity1985
- On the Uniform Convergence of Relative Frequencies of Events to Their ProbabilitiesTheory of Probability & Its Applications, 1971