Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Pavel Hubácek, Eylon Yogev. Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds. Electronic Colloquium on Computational Complexity (ECCC), 23:63, 2016. [doi]