Sciweavers

6 search results - page 2 / 2
» A proof of the q, t-square conjecture
Sort
View
FOCS
1998
IEEE
13 years 9 months ago
The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant
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 i...
Daniele Micciancio