DocumentCode
2074364
Title
Hardness of approximating the shortest vector problem in lattices
Author
Khot, Subhash
Author_Institution
Inst. for Adv. Study, Princeton, NJ, USA
fYear
2004
fDate
17-19 Oct. 2004
Firstpage
126
Lastpage
135
Abstract
Let p > 1 be any fixed real. We show that assuming NP
Keywords
BCH codes; approximation theory; computational complexity; lattice theory; randomised algorithms; tensors; BCH codes; NP-hard problem; augmented tensor product; closest vector problem; hardness factor; lattices; randomized reduction; shortest vector problem; Books; Computer science; Gaussian processes; Geometry; History; Lattices; Linear programming; Paper technology; Polynomials; Tensile stress;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE Symposium on
ISSN
0272-5428
Print_ISBN
0-7695-2228-9
Type
conf
DOI
10.1109/FOCS.2004.31
Filename
1366232
Link To Document