By Topic

Hardness of approximating the shortest vector problem in high Lp norms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Khot, S. ; Dept. of Comput. Sci., Princeton Univ., NJ, USA

We show that for every ε > 0, there is a constant p(ε) such that for all integers p ≥ p(ε), it is NP-hard to approximate the shortest vector problem in Lp norm within factor p1 - ε under randomized reductions. For large values of p, this improves the factor 21p/ - δ hardness shown by D. Micciancio (1998).

Published in:

Foundations of Computer Science, 2003. Proceedings. 44th Annual IEEE Symposium on

Date of Conference:

11-14 Oct. 2003