ACM Symposium on Discrete Algorithms, SODA 2017


Article Details
Title: Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
Article URLs:
Alternative Article URLs:
Authors: Pavel Hubácek
  • Weizmann Institute of Science, Israel
Eylon Yogev
  • Weizmann Institute of Science, Israel
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/soda/HubacekY17
Author Comments:

Discuss this paper and its artifacts below