ACM Symposium on Theory of Computing, STOC 2018

Article Details
Title: Hardness of approximate nearest neighbor search
Article URLs:
Alternative Article URLs:
Authors: Aviad Rubinstein
  • Harvard University
Sharing: Unknown
Verification: Author has not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/stoc/Rubinstein18
Author Comments:

Discuss this paper and its artifacts below