[HY17] Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds

Authors: Pavel Hubáček, Eylon Yogev | Venue: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2017 | Source

Abstract

TODO — abstract.

BibTeX

Copy

@Inproceedings{SODA:HubYog17,
  author = {Pavel Hub{\'a}cek and Eylon Yogev},
  title = {Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds},
  pages = {1352--1371},
  editor = {Philip N. Klein},
  booktitle = {28th Annual {ACM}-{SIAM} Symposium on Discrete Algorithms},
  address = {Barcelona, Spain},
  month = {jan~16--19},
  publisher = {{ACM-SIAM}},
  year = {2017},
  doi = {10.1137/1.9781611974782.88},
}