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

Pavel Hubáček, Eylon Yogev
January 2017
PDF Cite DOI
Type
Conference paper
Publication
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19