@inproceedings{Hub_ek_2017,
    doi = {10.1137/1.9781611974782.88},
    url = {https://doi.org/10.1137%2F1.9781611974782.88},
    year = {2017},
    month = {jan},
    publisher = {Society for Industrial and Applied Mathematics},
    author = {Pavel Hub{\'{a}}{\v{c}}ek and Eylon Yogev},
    title = {Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds},
    booktitle = {Proceedings of the Twenty-Eighth Annual {ACM}-{SIAM} Symposium on Discrete Algorithms}
}

@inproceedings{Hub_ek_2017, doi = {10.1137/1.9781611974782.88}, url = {https://doi.org/10.1137%2F1.9781611974782.88}, year = {2017}, month = {jan}, publisher = {Society for Industrial and Applied Mathematics}, author = {Pavel Hub{\'{a}}{\v{c}}ek and Eylon Yogev}, title = {Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds}, booktitle = {Proceedings of the Twenty-Eighth Annual {ACM}-{SIAM} Symposium on Discrete Algorithms} }