Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity
References 1. N. Alon, P. Frankl, and V. R¨odl. Geometrical realization of set systems and probabilistic communication complexity. In Proceedings of the 26th Symposium on Foundations of Computer Science, pages 277-280, 1985. 2. N. Alon and W. Maass. Meanders and their applications in lower bound arguments. Journal of Computer and System Sciences, 37:118-129, 1988. 3. Rosa I. Arriaga and Santosh Vempala. An algorithmic theory of learning: Robust concepts and random projection. In Proceedings of the 40'th Annual Symposium on the Foundations of Computer Science, pages 616-623, 1999. 4. Shai Ben-David, Nadav Eiron, and Hans Ulrich Simon. Limitations of learning via embeddings in euclidean half-spaces. In Proceedings of the 14th Annual Workshop on Computational Learning Theory, pages 385-401. Springer Verlag, 2001. 5. Jehoshua Bruck and Roman Smolensky. Polynomial threshold functions, AC0 functions and spectral norms. In Proceedings of the 31st Symposium on Foundations of Computer Science, pages 632-641, 1990. 6. Nello Christianini and John Shawe-Taylor. An Introduction to Support Vector Machines. Cambridge University Press, 2000. 7. J¨urgen Forster. A linear bound on the unbounded error probabilistic communication complexity. In Proceedings of the 16th Annual Conference on Computational Complexity, pages 100-106, 2001. 8. J¨urgen Forster, Niels Schmitt, and Hans Ulrich Simon. Estimating the optimal margins of embeddings in euclidean half spaces. In Proceedings of the 14th Annual Workshop on Computational Learning Theory, pages 402-415. Springer Verlag, 2001. 9. A. Hajnal, W. Maass, P. Pudl`ak, M. Szegedy, and G. Tur´an. Threshold circuits of bounded depth. Journal of Computer and System Sciences, 46:129-154, 1993. 10. Bernd Halstenberg and R¨udiger Reischuk. Di.erent modes of communication. SIAM Journal on Computing, 22(5):913-934, 1993. 11. Matthias Krause. Geometric arguments yield better bounds for threshold circuits and distributed computing. Theoretical Computer Science, 156:99-117, 1996. 12. Matthias Krause and Pavel Pudl´ak. On the computational power of depth-2 circuits with threshold and modulo gates. In Proceedings of the 25th Annual Symposium on Theory of Computing, pages 48-57, 1993. 13. Matthias Krause and Stephan Waack. Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fan-in. In Proceedings of the 32nd Symposium on Foundations of Computer Science, pages 777-782, 1991. 14. Ramamohan Paturi and Janos Simon. Probabilistic communication complexity. Journal of Computer and System Sciences, 33(1):106-123, 1986. 15. Martin Sauerho.. On the size of randomized OBDDs and read-once branching programs for k-stable functions. In Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, pages 488-499. Springer Verlag, 1999. 16. Ingo Wegner. Branching programs and binary decision diagrams - theory and applications. Monographs on Discrete Mathematics and Applications. SIAM, 2001.
