"Hardness of Continuous Local Search: Query Complexity and Cryptographic ..."

Pavel Hubácek, Eylon Yogev (2020)

> Home

Details and statistics

DOI: 10.1137/17M1118014

access: closed

type: Journal Article

metadata version: 2023-08-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/HubacekY20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/HubacekY20
Pavel Hubácek, Eylon Yogev:
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds. SIAM J. Comput. 49(6): 1128-1172 (2020)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.