{"id":"https://openalex.org/W4389787970","doi":"https://doi.org/10.1137/19m124705x","title":"Non-Black-Box Worst-Case to Average-Case Reductions Within \\(\\mathsf{NP}\\)","display_name":"Non-Black-Box Worst-Case to Average-Case Reductions Within \\(\\mathsf{NP}\\)","publication_year":2023,"publication_date":"2023-12-15","ids":{"openalex":"https://openalex.org/W4389787970","doi":"https://doi.org/10.1137/19m124705x"},"language":"en","primary_location":{"id":"doi:10.1137/19m124705x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m124705x","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/A5062484134","display_name":"Shuichi Hirahara","orcid":"https://orcid.org/0000-0002-3101-446X"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Shuichi Hirahara","raw_affiliation_strings":["National Institute of Informatics, Tokyo, 101-8430 Japan"],"affiliations":[{"raw_affiliation_string":"National Institute of Informatics, Tokyo, 101-8430 Japan","institution_ids":["https://openalex.org/I184597095"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062484134"],"corresponding_institution_ids":["https://openalex.org/I184597095"],"apc_list":null,"apc_paid":null,"fwci":0.202,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.5862186,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"52","issue":"6","first_page":"FOCS18","last_page":"349"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/mathematics","display_name":"Mathematics","score":0.7794756293296814},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6153969168663025},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5781857967376709},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.527422308921814},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5210099220275879},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.516899585723877},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.50555419921875},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4711769223213196},{"id":"https://openalex.org/keywords/black-box","display_name":"Black box","score":0.46168985962867737},{"id":"https://openalex.org/keywords/pseudorandom-generator","display_name":"Pseudorandom generator","score":0.4280601441860199},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.41991323232650757},{"id":"https://openalex.org/keywords/pseudorandom-number-generator","display_name":"Pseudorandom number generator","score":0.264055073261261},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18677595257759094},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09002584218978882}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7794756293296814},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6153969168663025},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5781857967376709},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.527422308921814},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5210099220275879},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.516899585723877},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.50555419921875},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4711769223213196},{"id":"https://openalex.org/C94966114","wikidata":"https://www.wikidata.org/wiki/Q29256","display_name":"Black box","level":2,"score":0.46168985962867737},{"id":"https://openalex.org/C92913381","wikidata":"https://www.wikidata.org/wiki/Q7255474","display_name":"Pseudorandom generator","level":3,"score":0.4280601441860199},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.41991323232650757},{"id":"https://openalex.org/C140642157","wikidata":"https://www.wikidata.org/wiki/Q1623338","display_name":"Pseudorandom number generator","level":2,"score":0.264055073261261},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18677595257759094},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09002584218978882},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/19m124705x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m124705x","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":[{"id":"https://metadata.un.org/sdg/16","score":0.5,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G4861343859","display_name":null,"funder_award_id":"JP16J06743","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"},{"id":"https://openalex.org/F4320334789","display_name":"Japan Science and Technology Agency","ror":"https://ror.org/00097mb19"},{"id":"https://openalex.org/F4320338242","display_name":"Advanced Information and Communication Technology for Innovation","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W269572962","https://openalex.org/W1548880861","https://openalex.org/W1901622511","https://openalex.org/W1967175855","https://openalex.org/W1973874352","https://openalex.org/W1984477611","https://openalex.org/W1993138363","https://openalex.org/W1994790157","https://openalex.org/W1998918799","https://openalex.org/W2015880590","https://openalex.org/W2016716306","https://openalex.org/W2028930979","https://openalex.org/W2037426925","https://openalex.org/W2048284438","https://openalex.org/W2051738174","https://openalex.org/W2056994701","https://openalex.org/W2062855793","https://openalex.org/W2062965695","https://openalex.org/W2083237534","https://openalex.org/W2086059606","https://openalex.org/W2089272132","https://openalex.org/W2100008268","https://openalex.org/W2108585502","https://openalex.org/W2117362057","https://openalex.org/W2155949379","https://openalex.org/W2156369551","https://openalex.org/W2163083173","https://openalex.org/W2165813048","https://openalex.org/W2169690324","https://openalex.org/W2343516500","https://openalex.org/W2399135883","https://openalex.org/W2402456376","https://openalex.org/W2608011726","https://openalex.org/W2610867264","https://openalex.org/W2745281314","https://openalex.org/W2773570193","https://openalex.org/W2787265165","https://openalex.org/W2884885487","https://openalex.org/W2912080987","https://openalex.org/W2998808137","https://openalex.org/W3102292552","https://openalex.org/W3138266838","https://openalex.org/W4205550388","https://openalex.org/W4230480142"],"related_works":["https://openalex.org/W2131810278","https://openalex.org/W2307719096","https://openalex.org/W1561811279","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W2963411648","https://openalex.org/W2952838392","https://openalex.org/W4299801389","https://openalex.org/W2016001296","https://openalex.org/W2019123979"],"abstract_inverted_index":{".There":[0],"are":[1,25,162],"significant":[2],"obstacles":[3],"to":[4,22,28,38,54,61,65],"establishing":[5,249],"an":[6,98,107,250],"equivalence":[7,251],"between":[8,252],"the":[9,46,50,73,91,115,152,170,173,176,190,235,241,253],"worst-case":[10,21,34,53,254],"and":[11,80,123,158,255],"average-case":[12,23,55,104,214,256],"hardness":[13,257],"of":[14,118,141,172,175,186,197,234,238,258],"\\(\\mathsf{NP}\\).":[15],"Several":[16],"results":[17,219],"suggest":[18],"that":[19,82,114,137,151],"black-box":[20],"reductions":[24,161],"not":[26],"likely":[27],"be":[29,62,167,221],"used":[30],"for":[31,206,227,248],"reducing":[32],"any":[33,131],"problem":[35,59,78,154,245],"outside":[36,63,156],"\\(\\mathsf{co}\\mathsf{NP}/\\mathsf{poly}\\)":[37,64,157],"a":[39,58,66,85,183,195,224],"distributional":[40,67],"\\(\\mathsf{NP}\\)":[41,68],"problem.":[42,69],"This":[43],"paper":[44],"overcomes":[45],"barrier.":[47],"We":[48,112,178],"present":[49],"first":[51],"non-black-box":[52],"reduction":[56,165],"from":[57],"conjectured":[60],"Specifically,":[70],"we":[71],"consider":[72],"minimum":[74,92,191,242],"time-bounded":[75,93],"Kolmogorov":[76,94,262],"complexity":[77,95],"(MINKT)":[79],"prove":[81],"there":[83],"exists":[84],"zero-error":[86],"randomized":[87],"polynomial-time":[88,110,132],"algorithm":[89],"approximating":[90,189],"\\(k\\)":[96],"within":[97,194],"additive":[99],"error":[100],"\\(\\widetilde{O}(\\sqrt{k})\\)":[101],"if":[102],"its":[103,139,213],"version":[105,117,215],"admits":[106],"errorless":[108],"heuristic":[109],"algorithm.":[111],"observe":[113],"approximation":[116,153,236],"MINKT":[119,239],"is":[120,127,155,203,216,246],"Random":[121],"3SAT-hard,":[122],"more":[124],"generally":[125],"it":[126],"harder":[128],"than":[129],"avoiding":[130],"computable":[133],"hitting":[134],"set":[135],"generator":[136],"extends":[138],"seed":[140],"length":[142],"\\(n\\)":[143],"by":[144],"\\(\\widetilde{\\omega":[145],"}(\\sqrt{n})\\),":[146],"which":[147],"provides":[148],"strong":[149],"evidence":[150],"thus":[159],"our":[160],"non-black-box.":[163],"Our":[164,218],"can":[166,220],"derandomized":[168],"at":[169],"cost":[171],"quality":[174],"approximation.":[177],"also":[179],"show":[180],"that,":[181],"given":[182],"truth":[184],"table":[185],"size":[187,193,244,265],"\\(2^n\\),":[188],"circuit":[192,243,264],"factor":[196],"\\(2^{(1":[198],"-":[199],"\\epsilon":[200],")":[201],"n}\\)":[202],"in":[204],"\\(\\mathsf{BPP}\\)":[205],"some":[207],"constant":[208],"\\(\\epsilon":[209],"\\gt":[210],"0\\)":[211],"iff":[212],"easy.":[217],"seen":[222],"as":[223],"new":[225],"approach":[226],"excluding":[228],"Heuristica.":[229],"In":[230],"particular,":[231],"proving":[232],"\\(\\mathsf{NP}\\)-hardness":[233],"versions":[237],"or":[240],"sufficient":[247],"\\(\\mathsf{NP}\\).Keywordsaverage-case":[259],"complexitynon-black-box":[260],"reductiontime-bounded":[261],"complexityminimum":[263],"problemMSC":[266],"codes68Q1568Q1768Q3094A60":[267]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}