Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"2log1-ε n hardness for the closest vector problem ..."

Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi (2012)

> Home

Details and statistics

DOI: 10.1145/2213977.2214004

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/KhotPV12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/KhotPV12
Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi:
2^{log1-ε n} hardness for the closest vector problem with preprocessing. STOC 2012: 277-288

a service of

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.