Pavel Hubácek, Eylon Yogev. Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds. Electronic Colloquium on Computational Complexity (ECCC), 23:63, 2016. [doi]
@article{HubacekY16,
title = {Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds},
author = {Pavel Hubácek and Eylon Yogev},
year = {2016},
url = {http://eccc.hpi-web.de/report/2016/063},
researchr = {https://researchr.org/publication/HubacekY16},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {23},
pages = {63},
}