The Shortest Vector in a Lattice Is Hard to Approximate to within Some Constant

@inproceedings{SIAMJ1998TheSV,
  title={The Shortest Vector in a Lattice Is Hard to Approximate to within Some Constant},
  author={C SIAMJ.},
  year={1998}
}
  • C SIAMJ.
  • Published 1998
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p √ 2 is hard for NP under reverse unfaithful random reductions with inverse polynomial error probability. In particular, approximating the shortest vector problem is not in RP (random polynomial time), unless NP equals RP. We also prove a proper NP-hardness result (i.e., hardness under deterministic many-one reductions) under a reasonable number theoretic conjecture on the… CONTINUE READING
Highly Cited
This paper has 126 citations. REVIEW CITATIONS

1 Figure or Table

Topics

Statistics

051015'97'99'01'03'05'07'09'11'13'15'17
Citations per Year

127 Citations

Semantic Scholar estimates that this publication has 127 citations based on the available data.

See our FAQ for additional information.