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

Journal of Computer and System Sciences

Volumn 54, Issue 2, 1997, Pages 317-331

  Arora, Sanjeev ^a   Babai, László ^a   Stern, Jacques ^a   Sweedyk, Z ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; NONLINEAR PROGRAMMING; PROBLEM SOLVING;

LINEAR EQUATION; NEAREST CODEWORD PROBLEM; NEAREST LATTICE VECTOR PROBLEM;

VECTORS;

EID: 0031119485     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1472     Document Type: Article

References (45)

1. N. Alon, U. Feige, A. Wigderson, and D. Zuckerman, "Dereandomized Graph Products," Manuscript, 1933.
2. E. Amaldi and V. Kann, The complexity and approximability of finding maximum feasible subsystems of linear relations, Theoret. Comput. Sci. 147 (1995), 187-210; an earlier version is in Proceedings STACS, 1994.
3. E. Amaldi and V. Kann, The complexity and approximability of finding maximum feasible subsystems of linear relations, Theoret. Comput. Sci. 147 (1995), 187-210; an earlier version is in Proceedings STACS, 1994.
4. E. Amaldi and V. Kann, "On the Approximability of Some NP-Hard Minimization Problems for Linear Systems," Technical Report 95-7, Cornell Computational Optimization Project, Cornell University, Ithaca, NY, 1995.
5. ∞ norm, unpublished note, 1996.
6. S. Arora and C. Lund, Hardness of approximations, survey chapter in "Approximation Algorithms for NP-hard Problems" (D. Hochbaum, Ed.), PWS, Boston, 1996.
7. S. Arora, C. Lund, R. Matwani, M. Sudan, and M. Szegedy, Proof verification and intractability of approximation problems, in "Proceedings, 33rd IEEE Symp. on Foundations of Computer Science," pp. 13-22, 1992.
8. S. Arora and S. Safra, Probabilistic checking of proofs: A new characterization of NP, in "Proceedings 33rd IEEE Symp. on Foundations of Computer Science," pp. 2-13, 1992.
9. L. Babai, On Lovász's lattice reduction and the nearest lattice point problem, Combinatorica II (1986), 1-14.
10. L. Babai, L. Fortnow, L. Levin, and M. Szegedy, Checking computations in polylogarithmic time, in "Proceedings, 23rd Symp. on Theory of Computing," pp. 21-31, 1992.
11. L. Babai, L. Fortnow, and C. Lund, Non-deterministic exponential time has two-prover interactive protocols, Comput. Complexity 1 (1991), 16-25.
12. M. Bellare, "Interactive Proofs and Approximations," IBM Res. Rep. RC 17969, 1992.
13. M. Bellare, S. Goldwasser, C. Lund, and A. Russell, Efficient multi-prover interactive proofs with applications to approximation problems, in "Proceedings 25th ACM Symp. on Theory of Computing," pp. 113-131, 1993.
14. M. Bellare and P. Rogaway, The complexity of approximating non-linear programs, in "Complexity of Numerical Optimization" (P. M. Pardalos, Ed.), World Scientific, Singapore, 1993; preliminary version, IBM Research Report RC 17831, March 1992.
15. M. Bellare and P. Rogaway, The complexity of approximating non-linear programs, in "Complexity of Numerical Optimization" (P. M. Pardalos, Ed.), World Scientific, Singapore, 1993; preliminary version, IBM Research Report RC 17831, March 1992.
16. M. Ben-or, S. Goldwasser, J. Kilian, and A. Wigderson, Multiprover interactive proofs: How to remove intractability assumptions, in "Proceedings 20th ACM Symp. on Theory of Computing," pp. 113-121, 1988.
17. E. R. Berlekamp, R. J. Mc Eliece, and H. C. A. Van Tilborg, On the inherent intractability of certain coding problems, Trans. Inform. Theory (1978), 384-386.
18. M. Blum, S. Kannan, Designing programs that check their work, in "Proceedings 21st ACM Symp. on Theory of Computing," pp. 86-97, 1989.
19. M. Blum, M. Luby, and R. Rubinfeld, Self-testing/correcting with applications to numerical problems, in "Proceedings 22nd ACM Symp. on Theory of Computing," pp. 73-83, 1990.
20. B. Bollobás, "Combinatorics," Cambridge Univ. Press, Cambridge, 1986.
21. J. Bruck and M. Naor, The hardness of decoding linear codes with preprocessing, IEEE Trans. Inform. Theory (1990), 381-385.
22. A. Condon, The complexity of the max-word problem and the power of one-way interactive proof systems, Comput. Complexity 3 (1993), 292-305; Preliminary version appeared in "Proc. 8th Symp. on Theor. Aspects of Comp. Sci.," Lect. Notes in Comput. Sci., Springer-Verlag, New York/Berlin, pp. 456-465, 1991.
23. A. Condon, The complexity of the max-word problem and the power of one-way interactive proof systems, Comput. Complexity 3 (1993), 292-305; Preliminary version appeared in "Proc. 8th Symp. on Theor. Aspects of Comp. Sci.," Lect. Notes in Comput. Sci., Springer-Verlag, New York/Berlin, pp. 456-465, 1991.
24. U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy, Approximating clique is almost NP-complete, in "Proceedings 32nd IEEE Symp. on Foundations of Computer Science," pp. 2-12, 1991.
25. U. Feige and L. Lovász, Two-prover one-round proof systems: Their power and their problems, in "Proc. 24th ACM Symp. on Theory of Computing," pp. 733-741, 1992.
26. A. Frank and É. Tardos, An application of simultaneous approximation in combinatorial optimization, in "Proceedings, 26th IEEE Symp. on Foundations of Computer Science," pp. 459-463, 1985.
27. M. R. Garey and D.S. Johnson, "Computers and Intractability: A Guide to the theory of NP-Completeness," Freeman, San Francisco, 1979.
28. K-U. Hoeffgen and H-U. Simon, Robust trainability of single neurons, in "Proceedings, of the Conference of Learning Theory," pp. 428-439, 1992.
29. D. S. Johnson and F. P. Preparata, The densest hemisphere problem, Theor. Comput. Sci. 6 (1978), 93-107.
30. R. Kannan, Minkowski's convex body theorem and integer programming, Math. Oper. Res. 12 No. 3, (1987).
31. R. Kannan, Algorithms geometry of numbers, in "Annual Reviews of Computer Science" (Traub, Grosz, Lampson, and Nilsson, Eds.), Vol.2, pp. 231-267, Publ. Annual Reviews Inc., 1987.
32. R. M. Karp, Reducibility among combinatorial problems, in "Complexity of Computer Computations" (Miller and Thatcher, Eds.), pp. 85-103, Plenum, New York, 1972.
33. J. Lagarias, H. W. Lenstra, and C. P. Schnorr, Korkine Zolotarev bases and successive minima of a lattice and its reciprocal lattice, Combinatorica 10 (1990), 333-348.
34. J. C. Lagarius and A. M. Odlyzko, Solving low-density subset-sum problems, J. Assoc. Comput. Mach. 32 (1985), 229-246.
35. A. K. Lenstra, H. W. Lenstra, and L. Lovász, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982), 513-534.
36. L. Lovász, "An Algorithmic Theory of Numbers, Graphs and Convexity," NSF-CBMS Reg. Conference Series, SIAM, Philadelphia, 1986.
37. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, J. A. C. M. 41, No. 5 (1994), 960-981; prelim, version in "25th STOC," pp. 286-293, 1993.
38. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, J. A. C. M. 41, No. 5 (1994), 960-981; prelim, version in "25th STOC," pp. 286-293, 1993.
39. M. Minsky and S. Papert, "Perceptrons," 1968.
40. C. Papadimitriou and M. Yannakakis, Optimization, approximation and complexity classes, J. Comput. System Sci. 43 (1991), 425-440; prelim, version in "20th ACM STOC," pp. 229-234, 1988.
41. C. Papadimitriou and M. Yannakakis, Optimization, approximation and complexity classes, J. Comput. System Sci. 43 (1991), 425-440; prelim, version in "20th ACM STOC," pp. 229-234, 1988.
42. C. P. Schnorr, A hierarchy of polynomial-time basis reduction algorithms, in "Proceedings, Conf. on Algorithms, Pécs, Hungary" (Lovász and Szemerédi, Eds.), pp. 375-386 North-Holland, Amsterdam, 1985.
43. J. Stern, Approximating the number of error locations is NP-complete, in "Proceedings, AAECC-10," to appear.
44. P. van Emde Boas, "Another NP-Complete Problem and the Complexity of Computing Short Vectors in a Lattice," Tech. Report 81-04, Math. Inst., Univ. Amsterdam, 1981.
45. D. Zuckerman, NP-complete problems have a version that's hard to approximate, in "8th Structure in Complexity Theory Conf. 1993," pp. 305-312.