Approximating SVP∞ to within almost-polynomial factors is NP-hard

Theoretical Computer Science

Volumn 285, Issue 1, 2002, Pages 55-71

  Dinur, Irit ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Hardness of approximation; Lattice problems; Shortest vector

Indexed keywords

ALGORITHMS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; VECTORS;

CLOSEST VECTOR PROBLEMS (CVP); SHORTEST VECTOR PROBLEMS (SVP);

COMPUTER SCIENCE;

EID: 0037125666     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00290-0     Document Type: Conference Paper

References (17)

1. Generating hard instances of lattice problems
2. The shortest vector problem in L2 is NP-hard for randomized reductions
3. The hardness of approximate optima in lattices, codes and linear equations
4. On Lovász's lattice reduction and the nearest lattice point problem
5. ε) is NP-hard under randomized reductions
6. The complexity of theorem-proving procedures
7. PCP characterizations of NP: Towards a polynomially-small error-probability
8. Approximating-CVP to within almost-polynomial factors is NP-hard
9. An application of simultaneous approximation in combinatorial optimization
10. On the limits of non-approximability of lattice problems
11. Solving low-density subset sum problems
12. Factoring polynomials with rational coefficients
13. Universal'nyǐe perebornyǐe zadachi universal search problems
14. The shortest vector in a lattice is hard to approximate to within some constant
15. A hierarchy of polynomial-time basis reduction algorithms