The Hardness of Approximate Optimia in Lattices, Codes, and Systems of Linear Equations

Sanjeev Arora, László Babai, Jacques Stern, Z. Sweedyk. The Hardness of Approximate Optimia in Lattices, Codes, and Systems of Linear Equations. In 34th Annual Symposium on Foundations of Computer Science, 3-5 November 1993, Palo Alto, California, USA. pages 724-733, IEEE, 1993.

Abstract

Abstract is missing.