{"id":"https://openalex.org/W3103382473","doi":"https://doi.org/10.1137/17m1118014","title":"Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds","display_name":"Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3103382473","doi":"https://doi.org/10.1137/17m1118014","mag":"3103382473"},"language":"en","primary_location":{"id":"doi:10.1137/17m1118014","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1118014","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005607969","display_name":"Pavel Hub\u00e1\u010dek","orcid":"https://orcid.org/0000-0002-6850-6222"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Pavel Hub\u00e1\u010dek","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5048056525","display_name":"Eylon Yogev","orcid":"https://orcid.org/0000-0001-8599-2472"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eylon Yogev","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005607969"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5629,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.73807805,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"49","issue":"6","first_page":"1128","last_page":"1172"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.6570112109184265},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.5520669221878052},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.5162253379821777},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.47905290126800537},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4734594225883484},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.46262121200561523},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.45319756865501404},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4435702860355377},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3950439393520355},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3713574707508087},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.24388116598129272}],"concepts":[{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6570112109184265},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5520669221878052},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.5162253379821777},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.47905290126800537},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4734594225883484},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.46262121200561523},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.45319756865501404},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4435702860355377},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3950439393520355},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3713574707508087},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.24388116598129272},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/17m1118014","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1118014","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1826384874","https://openalex.org/W1966347268","https://openalex.org/W1980813953","https://openalex.org/W2002373723","https://openalex.org/W2007873061","https://openalex.org/W2008758668","https://openalex.org/W2017781790","https://openalex.org/W2032556376","https://openalex.org/W2037611290","https://openalex.org/W2046839291","https://openalex.org/W2054129049","https://openalex.org/W2061073612","https://openalex.org/W2062459871","https://openalex.org/W2067050450","https://openalex.org/W2070060459","https://openalex.org/W2083120484","https://openalex.org/W2084641398","https://openalex.org/W2103981148","https://openalex.org/W2108614294","https://openalex.org/W2169359757","https://openalex.org/W2474861573","https://openalex.org/W2520555871","https://openalex.org/W2531325587","https://openalex.org/W2560067070","https://openalex.org/W2811432292","https://openalex.org/W3023447009","https://openalex.org/W4213176525","https://openalex.org/W4247782324","https://openalex.org/W4254547512"],"related_works":["https://openalex.org/W3110702597","https://openalex.org/W2073713056","https://openalex.org/W2125620709","https://openalex.org/W2110441383","https://openalex.org/W2045932760","https://openalex.org/W2326878701","https://openalex.org/W4293864700","https://openalex.org/W2184228419","https://openalex.org/W67445448","https://openalex.org/W2303442355"],"abstract_inverted_index":{"Local":[0],"search":[1,87,125,236,252],"proved":[2],"to":[3,40,70,165,202,265,290],"be":[4],"an":[5,60],"extremely":[6],"useful":[7],"tool":[8],"when":[9,62],"facing":[10],"hard":[11,77],"optimization":[12,49],"problems":[13,88,126,237],"(e.g.,":[14],"via":[15],"the":[16,48,64,72,92,110,136,147,166,173,182,208,281,284],"simplex":[17],"algorithm,":[18],"simulated":[19],"annealing,":[20],"or":[21],"genetic":[22],"algorithms).":[23],"Although":[24],"powerful,":[25],"it":[26,269,278],"has":[27],"its":[28],"limitations:":[29],"there":[30],"are":[31,38,156],"functions":[32],"for":[33,140,188,214,233,277,299],"which":[34,57,106,189,254],"exponentially":[35,197],"many":[36,46,198],"queries":[37,199],"needed":[39],"find":[41,203],"a":[42,54,128,179,204,224,249,292],"local":[43,65,80,205,235],"optimum.":[44,206],"In":[45,131,181,207],"contexts,":[47],"problem":[50,253],"is":[51,78,89,107,168,175,270],"defined":[52,149],"by":[53,91,178],"continuous":[55,79,240],"function":[56,167,174],"might":[58],"offer":[59],"advantage":[61],"performing":[63],"search.":[66],"This":[67],"leads":[68],"us":[69,264],"study":[71],"following":[73],"natural":[74],"question:":[75],"How":[76],"search?":[81],"The":[82,258],"computational":[83],"complexity":[84,93],"of":[85,103,112,119,123,151,159,230,261,294],"such":[86],"captured":[90],"class":[94,122,145],"${CLS}$":[95,141,291],"[C.":[96],"Daskalakis":[97],"and":[98,114,170,283,287],"C.":[99],"H.":[100],"Papadimitriou,":[101],"Proceedings":[102],"SODA'11,":[104],"2011],":[105],"contained":[108,271],"in":[109,157,200,272,279],"intersection":[111],"${PLS}$":[113],"${PPAD}$,":[115],"two":[116],"important":[117],"subclasses":[118,150],"${TFNP}$":[120],"(the":[121,142],"${NP}$":[124],"with":[127],"guaranteed":[129],"solution).":[130],"this":[132],"work,":[133],"we":[134,185,211,247,255],"show":[135,186,212,267],"first":[137],"hardness":[138,154,213,276],"results":[139,155,222,295],"smallest":[143],"nontrivial":[144],"among":[146],"currently":[148],"$\\mathbf{TFNP}$).":[152],"Our":[153,221],"terms":[158],"black-box":[160,183,282],"(where":[161,172],"only":[162,298],"oracle":[163],"access":[164],"given)":[169],"white-box":[171,209,285],"represented":[176],"succinctly":[177],"circuit).":[180],"case,":[184,210],"instances":[187],"any":[190],"(computationally":[191],"unbounded)":[192],"randomized":[193],"algorithm":[194],"must":[195],"perform":[196],"order":[201],"computationally":[215],"bounded":[216],"algorithms":[217,232],"under":[218],"cryptographic":[219],"assumptions.":[220],"demonstrate":[223],"strong":[225],"conceptual":[226],"barrier":[227],"precluding":[228],"design":[229],"efficient":[231],"solving":[234],"even":[238],"over":[239],"domains.":[241],"As":[242],"our":[243],"main":[244],"technical":[245],"contribution":[246],"introduce":[248],"new":[250],"total":[251],"call":[256],"End-of-Metered-Line.":[257],"special":[259],"structure":[260],"End-of-Metered-Line":[262],"enables":[263],"(1)":[266],"that":[268],"${CLS}$,":[273],"(2)":[274],"prove":[275],"both":[280],"setting,":[286],"(3)":[288],"extend":[289],"variety":[293],"previously":[296],"known":[297],"${PPAD}$.":[300]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}