A linear lower bound on the unbounded error probabilistic communication complexity

Journal of Computer and System Sciences

Volumn 65, Issue 4, 2002, Pages 612-625

  Forster, Jürgen ^a  

^a RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

Hadamard matrix; Lower bounds; Probabilistic communication complexity; Spectral norm

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING; SPECTRUM ANALYSIS; THEOREM PROVING;

HADAMARD MATRIX; LOWER BOUNDS; PROBABILISTIC COMPLEXITY; SPECTRAL NORMS;

LINEAR SYSTEMS;

EID: 9444262655     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/S0022-0000(02)00019-3     Document Type: Conference Paper

References (17)

1. N. Alon, P. Frankl, V. Rödl, Geometrical realization of set systems and probabilistic communication complexity, Proceedings of the 26th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, Portland, OR, 1985.
2. S. Ben-David, N. Eiron, H.U. Simon, Limitations of learning via embeddings in Euclidean half-spaces (David P. Helmbold and Bob Williamson, Eds.), Proceedings of the 14th Annual Workshop on Computational Learning Theory, Springer, Berlin, Heidelberg, 2001.
3. A. Blumer, A. Ehrenfeucht, D. Haussler, M.K. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, J. ACM 100 (1989) 157-184.
4. N. Cristianini, J. Shawe-Taylor, An Introduction to Support Vector Machines, Cambridge University Press, Cambridge, UK, 2000.
5. J. Forster, A linear lower bound on the unbounded error probabilistic communication complexity (Francis M. Titsworth, Ed.), Proceedings of the 16th IEEE Annual Conference on Computational Complexity, IEEE Computer Society Press, Silver Spring, MD, 2001, pp. 100-106.
6. J. Forster, M. Krause, S.V. Lokam, R. Mubarakzjanov, N. Schmitt, H.U. Simon, Relations between communication complexity, linear arrangements and computational complexity, Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science, Springer, Berlin, 2001, pp. 171-182.
7. J. Forster, N. Schmitt, H. U. Simon, Estimating the optimal margins of embeddings in Euclidean half spaces, Proceedings of the 14th Annual Conference on Computational Learning Theory, Springer, Berlin, 2001, pp. 402-415.
8. J. Forster, M.K. Warmuth, Relative loss bounds for temporal-difference learning, Proceedings of the Seventeenth International Conference on Machine Learning, Morgan Kaufmann, San Francisco, 2000, pp. 295-302.
9. G.H. Golub, C.F. Van Loan, Matrix Computations, The Johns Hopkins University Press, Baltimore and London, 1991.
10. R.A. Horn, C.R. Johnson, Matrix analysis, Cambridge University Press, Cambridge, UK, 1985.
11. M.J. Kearns, U.V. Vazirani, An Introduction to Computational Learning Theory, MIT Press, Cambridge, MA, 1994.
12. M. Krause, Geometric arguments yield better bounds for threshold circuits and distributed computing, Theoret. Comput. Sci. 156 (1996) 99-117.
13. E. Kushilevitz, N. Nisan, Communication Complexity, Cambridge University Press, Cambridge, UK, 1997.
14. R. Paturi, J. Simon, Probabilistic communication complexity, J. Comput. System Sci. 33 (1986) 106-123.
15. W. Rudin, Real and Complex Analysis, McGraw-Hill, New York, 1974.
16. V. Vapnik, Statistical Learning Theory, Wiley, New York, 1998.
17. V.N. Vapnik, A.Y. Chervonenkis, On the uniform convergence of relative frequencies of events to their probabilities, Theory Probab. Appl. 16 (1971) 264-280.