Approximating SVPinfty to within Almost-Polynomial Factors Is NP-Hard

Authors:
Irit Dinur
Affiliations:
-
Venue:
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Year:
2000

Citing 12
Cited 2

Solving low-density subset sum problems

Journal of the ACM (JACM)
On Lova´sz' lattice reduction and the nearest lattice point problem

Combinatorica
Generating hard instances of lattice problems (extended abstract)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On the limits of non-approximability of lattice problems

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
PCP characterizations of NP: towards a polynomially-small error-probability

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximating the SVP to within a Factor is NP-Hard under Randomized Reductions

COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
Approximating-CVP to within Almost-Polynomial Factors is NP-Hard

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
An application of simultaneous approximation in combinatorial optimization

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
The hardness of approximate optima in lattices, codes, and systems of linear equations

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science

New Hardness Results for Diophantine Approximation

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Note: Inapproximability results for the minimum integral solution problem with preprocessing over l∞ norm

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show SVP∞ and CVP∞ to be NP-hard to approximate to within nc/log log n for some constant c 0. We show a direct reduction from SAT to these problems, that combines ideas from [ABSS93] and from [DKRS99], along with some modifications. Our result is obtained without relying on the PCP characterization of NP, although some of our techniques are derived from the proof of the PCP characterization itself [DFK+99].