Author:
Forster Jürgen,Krause Matthias,Lokam Satyanarayana V.,Mubarakzjanov Rustam,Schmitt Niels,Simon Hans Ulrich
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. N. Alon, P. Frankl, and V. Rödl. 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, AC 0 functions and spectral norms. In Proceedings of the 31st Symposium on Foundations of Computer Science, pages 632–641, 1990.
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献