


default search action
"2log1-ε n hardness for the closest vector problem ..."
Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi (2012)
- Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi:
2log1-ε n hardness for the closest vector problem with preprocessing. STOC 2012: 277-288

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.