![](/img/cover-not-exists.png)
[Society for Industrial and Applied Mathematics Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms - ()] Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms - Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
Hubáček, Pavel, Yogev, EylonLanguage:
english
DOI:
10.1137/1.9781611974782.88
File:
PDF, 560 KB
english