[Society for Industrial and Applied Mathematics Proceedings...

  • Main
  • [Society for Industrial and Applied...

[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, Eylon
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Language:
english
DOI:
10.1137/1.9781611974782.88
File:
PDF, 560 KB
english
Conversion to is in progress
Conversion to is failed