Pavel Hubácek, Eylon Yogev. Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds. In Philip N. Klein, editor, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19. pages 1352-1371, SIAM, 2017. [doi]
Abstract is missing.