Skip to main navigation
Skip to search
Skip to main content
NYU Scholars Home
Help & FAQ
Home
Profiles
Research units
Research output
Search by expertise, name or affiliation
Hardness of approximating the shortest vector problem in lattices
Subhash Khot
Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Hardness of approximating the shortest vector problem in lattices'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Engineering & Materials Science
Hardness
100%
Tensors
62%
Polynomials
48%
Approximation algorithms
34%