Author:
Alon Noga,Panigrahy Rina,Yekhanin Sergey
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Alekhnovich, M.: More on average case vs. approximation complexity. In: Proc. of the 44rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 298–307 (2003)
2. Arora, S., Babai, L., Stern, J., Sweedyk, Z.: Hardness of approximate optima in lattices, codes, and linear systems. Journal of Computer and System Sciences 54(2), 317–331 (1997)
3. Berman, P., Karpinski, M.: Approximating minimum unsatisfiability of linear equations. In: Proc. of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 514–516 (2002)
4. Dumer, I., Miccancio, D., Sudan, M.: Hardness of approximating the minimum distance of a linear code. IEEE Transactions on Information Theory 49(1), 22–37 (2003)
5. Friedman, J.: A note on matrix rigidity. Combinatorica 13(2), 235–239 (1993)
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献