Author:
Amaldi Edoardo,Kann Viggo
Subject
General Computer Science,Theoretical Computer Science
Reference40 articles.
1. N. Alon, U. Feige, A. Wigderson and D. Zuckerman, Derandomized graph products, Comput. Complexity, to appear.
2. Explicit construction of linear sized tolerant networks;Alon;Discrete Math.,1988
3. On the complexity of training perceptrons;Amaldi,1991
4. The hardness of approximate optima in lattices, codes, and systems of linear equations;Arora,1993
Cited by
125 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献