Author:
Alon Noga,Feige Uriel,Wigderson Avi,Zuckerman David
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference25 articles.
1. M. Ajtai, J. Komlós, and E. Szemerédi, Deterministic Simulation in Logspace.Proc. Nineteenth Ann. ACM Symp. Theor. Comput., 1987, 132?140.
2. N. Alon, Eigenvalues and expanders.Combinatorica 6 (1986), 83?96.
3. N. Alon andF. R. K. Chung, Explicit construction of linear sized tolerant networks.Discrete Math. 72 (1988), 15?19.
4. E. Amaldi and V. Kann, The complexity and approximability of finding maximum feasible subsystems of linear relations.Theoret. Comput. Sci., to appear.
5. S. Arora, L. Babai, J. Stern, and Z. Sweedyk, The Hardness of Approximate Optima in Lattices, Codes and Linear Equations.Proc. 34th Ann. IEEE Symp. Found. Comput. Sci., 1993, 724?733. (Final version submitted toJ. Comput. System Sci.)
Cited by
82 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献