Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. M. Ajtai, “Generating Hard Instances of Lattice Problems”, Proc. 28th Symposium on Theory of Computing 1996, pp. 99–108.
2. M. Ajtai, “Worst-Case Complexity, Average-Case Complexity and Lattice Problems”, Proc. International Congress of Mathematicians 1998, Vol. III, pp. 421–428.
3. S. Arora, C. Lund, “Hardness of Approximations”, in D. S. Hochbaum (ed.), Approximation Algorithms for NP-Hard Problems, PWS Publishing, 1997.
4. S. Arora, L. Babai, J. Stern, Z. Sweedyk, “The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations”, Journal of Computer and System Sciences Vol. 54, pp. 317–331, 1997.
5. M. Ajtai, C. Dwork“A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence”, Proc. 29th Symposium on Theory of Computing 1997, pp. 284–293.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献