{"id":"https://openalex.org/W4415473618","doi":"https://doi.org/10.1007/s00037-025-00279-2","title":"Instance-Wise Hardness and Refutation versus Derandomization for Arthur-Merlin Protocols","display_name":"Instance-Wise Hardness and Refutation versus Derandomization for Arthur-Merlin Protocols","publication_year":2025,"publication_date":"2025-10-23","ids":{"openalex":"https://openalex.org/W4415473618","doi":"https://doi.org/10.1007/s00037-025-00279-2"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-025-00279-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-025-00279-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-025-00279-2.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00037-025-00279-2.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111961315","display_name":"Dieter van Melkebeek","orcid":null},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dieter van Melkebeek","raw_affiliation_strings":["University of Wisconsin, Madison, 53706, WI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wisconsin, Madison, 53706, WI, USA","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074651154","display_name":"Nicollas M. Sdroievski","orcid":null},"institutions":[{"id":"https://openalex.org/I3020652664","display_name":"Universidade Estadual do Paran\u00e1","ror":"https://ror.org/049rrx986","country_code":"BR","type":"education","lineage":["https://openalex.org/I3020652664"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Nicollas Mocelin Sdroievski","raw_affiliation_strings":["State University of Paran\u00e1, Apucarana, PR, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"State University of Paran\u00e1, Apucarana, PR, Brazil","institution_ids":["https://openalex.org/I3020652664"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111961315"],"corresponding_institution_ids":["https://openalex.org/I135310074"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14707667,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"34","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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.9993000030517578,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8203999996185303},{"id":"https://openalex.org/keywords/pseudorandom-number-generator","display_name":"Pseudorandom number generator","score":0.6266000270843506},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5171999931335449},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5011000037193298},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.486299991607666},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.47530001401901245},{"id":"https://openalex.org/keywords/pseudorandom-generator","display_name":"Pseudorandom generator","score":0.4690000116825104},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.45680001378059387},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.450300008058548},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4284999966621399}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8203999996185303},{"id":"https://openalex.org/C140642157","wikidata":"https://www.wikidata.org/wiki/Q1623338","display_name":"Pseudorandom number generator","level":2,"score":0.6266000270843506},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5266000032424927},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5171999931335449},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5065000057220459},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5011000037193298},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.486299991607666},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47540000081062317},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.47530001401901245},{"id":"https://openalex.org/C92913381","wikidata":"https://www.wikidata.org/wiki/Q7255474","display_name":"Pseudorandom generator","level":3,"score":0.4690000116825104},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.45680001378059387},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.450300008058548},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4359000027179718},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4284999966621399},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4115999937057495},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.4050999879837036},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.3801000118255615},{"id":"https://openalex.org/C105355099","wikidata":"https://www.wikidata.org/wiki/Q720931","display_name":"One-way function","level":3,"score":0.3799000084400177},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.36079999804496765},{"id":"https://openalex.org/C201866948","wikidata":"https://www.wikidata.org/wiki/Q228206","display_name":"Random number generation","level":2,"score":0.3594000041484833},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.3540000021457672},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.3443000018596649},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3440999984741211},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.3271999955177307},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3237999975681305},{"id":"https://openalex.org/C19086982","wikidata":"https://www.wikidata.org/wiki/Q2115856","display_name":"Pseudorandomness","level":3,"score":0.29649999737739563},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.2962999939918518},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.2806999981403351},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.2786000072956085},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.27810001373291016},{"id":"https://openalex.org/C137343475","wikidata":"https://www.wikidata.org/wiki/Q622849","display_name":"Halting problem","level":4,"score":0.27549999952316284},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.2703000009059906},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.26579999923706055},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.26429998874664307},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.2630999982357025},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2574999928474426}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00037-025-00279-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-025-00279-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-025-00279-2.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00037-025-00279-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-025-00279-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-025-00279-2.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5953527776","display_name":"AF: Small: The Power of Randomness in Decision and Verification","funder_award_id":"2312540","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309434","display_name":"University of Wisconsin-Madison","ror":"https://ror.org/01y2jtd41"},{"id":"https://openalex.org/F4320337368","display_name":"Division of Graduate Education","ror":"https://ror.org/00whkrf32"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4415473618.pdf","grobid_xml":"https://content.openalex.org/works/W4415473618.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W159330758","https://openalex.org/W1966214710","https://openalex.org/W1973874352","https://openalex.org/W1998918799","https://openalex.org/W2021736779","https://openalex.org/W2028556586","https://openalex.org/W2029767661","https://openalex.org/W2062855793","https://openalex.org/W2071520502","https://openalex.org/W2082571280","https://openalex.org/W2083237534","https://openalex.org/W2098324348","https://openalex.org/W2131757234","https://openalex.org/W2135393523","https://openalex.org/W2135453633","https://openalex.org/W2140797111","https://openalex.org/W2148957455","https://openalex.org/W2158747250","https://openalex.org/W2175404758","https://openalex.org/W2343516500","https://openalex.org/W2998808137","https://openalex.org/W3126402506","https://openalex.org/W3165549676","https://openalex.org/W3174573547","https://openalex.org/W4206758876","https://openalex.org/W4212956348","https://openalex.org/W4313228091","https://openalex.org/W4390098159"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"A":[1,27],"fundamental":[2],"question":[3,29],"in":[4,20,30,48,64,93,124,160,215,225,245,265,309,394],"computational":[5],"complexity":[6],"asks":[7,36],"whether":[8,37],"probabilistic":[9],"polynomial-time":[10],"algorithms":[11,107,193],"can":[12,40,293],"be":[13,41,375],"simulated":[14,42],"deterministically":[15],"with":[16,44],"a":[17,45,115,130,137,166,197,205,230,240,325,358],"small":[18,46],"overhead":[19,47],"time":[21,49,246,266],"(the":[22,50],"BPP":[23,95,162,185],"vs.":[24,52,403],"P":[25],"problem).":[26,54],"corresponding":[28,206],"the":[31,94,134,141,150,161,216,226,340,365,378,395,399],"realm":[32],"of":[33,133,136,169,184,222,330,342,352,360,372,380],"interactive":[34],"proofs":[35,351],"Arthur-Merlin":[38,209,261,320],"protocols":[39,210,321],"nondeterministically":[43],"AM":[51,217,307,331,373],"NP":[53],"Both":[55],"questions":[56],"are":[57],"intricately":[58],"tied":[59],"to":[60,78,117,156,188,377],"lower":[61,79,101,190,317],"bounds.":[62],"Prominently,":[63],"both":[65],"settings":[66],"blackbox":[67],"derandomization,":[68],"i.e.,":[69],"derandomization":[70,99,183,329,371,414],"through":[71,196,324],"pseudorandom":[72,171],"generators,":[73],"has":[74],"been":[75],"shown":[76],"equivalent":[77,187,376],"bounds":[80,102,191,318],"for":[81,103,208,275,354,384,406,416],"decision":[82],"problems":[83],"against":[84,106,192,319],"circuits.":[85],"Recently,":[86],"Chen":[87],"and":[88,100,178,211,328],"Tell":[89],"(FOCS'21)":[90],"established":[91],"nearequivalences":[92],"setting":[96,163,397],"between":[97,315],"whitebox":[98,370],"multi-bit":[104],"functions":[105],"on":[108,129,149,302,348],"almost-all":[109],"inputs.":[110],"The":[111],"key":[112],"ingredient":[113],"is":[114,186,308,339],"technique":[116,207],"translate":[118],"hardness":[119,402],"into":[120],"targeted":[121,333,344,381],"hitting":[122],"sets":[123],"an":[125,220,386,411],"instance-wise":[126],"fashion":[127],"based":[128,347],"layered":[131],"arithmetization":[132],"evaluation":[135],"uniform":[138,401],"circuit":[139],"computing":[140],"hard":[142],"function":[143,232],"$$f$$":[144,233,296],"<mml:math":[145,234,248,268,278,297],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[146,235,249,269,279,298],"<mml:mi>f</mml:mi>":[147,236,299],"</mml:math>":[148,237,254,274,292,300],"given":[151],"instance.":[152],"Follow-up":[153],"works":[154],"managed":[155],"obtain":[157,313,364],"full":[158],"equivalences":[159,314],"by":[164,239,389],"exploiting":[165],"compression":[167,198,326],"property":[168],"classical":[170],"generator":[172],"constructions.":[173],"In":[174,200],"particular,":[175],"Chen,":[176],"Tell,":[177],"Williams":[179],"(FOCS'23)":[180],"showed":[181],"that":[182,194,243,258,263,322,369],"constructive":[189,316],"go":[195,323],"phase.":[199],"this":[201],"paper,":[202],"we":[203,363],"develop":[204],"establish":[212],"similar":[213],"near-equivalences":[214],"setting.":[218],"As":[219,357],"example":[221],"our":[223,361],"results":[224],"hardness-to-derandomization":[227],"direction,":[228],"consider":[229],"length-preserving":[231],"computable":[238],"nondeterministic":[241,355],"algorithm":[242],"runs":[244,264],"$$n^a$$":[247],"<mml:msup>":[250,270,285],"<mml:mi>n</mml:mi>":[251,271],"<mml:mi>a</mml:mi>":[252,289],"</mml:msup>":[253,273,288],".":[255],"We":[256,311],"show":[257],"if":[259],"every":[260],"protocol":[262],"$$n^c$$":[267],"<mml:mi>c</mml:mi>":[272,281],"$$c=O(\\log^2":[276],"a)$$":[277],"<mml:mrow>":[280],"<mml:mo>=</mml:mo>":[282],"<mml:mi>O</mml:mi>":[283],"<mml:mo>(</mml:mo>":[284],"<mml:mo>log</mml:mo>":[286],"<mml:mn>2</mml:mn>":[287],"<mml:mo>)</mml:mo>":[290],"</mml:mrow>":[291],"only":[294],"compute":[295],"correctly":[301],"finitely":[303],"many":[304],"inputs,":[305],"then":[306],"NP.":[310],"also":[312],"phase":[327],"via":[332],"generators.":[334],"Our":[335],"main":[336],"technical":[337],"contribution":[338],"construction":[341],"suitable":[343],"hitting-set":[345,382],"generators":[346,383],"probabilistically":[349],"checkable":[350],"proximity":[353],"computations.":[356],"by-product":[359],"constructions,":[362],"first":[366,400],"result":[367,415],"indicating":[368],"may":[374],"existence":[379],"AM,":[385,407],"issue":[387],"raised":[388],"Goldreich":[390],"(LNCS,":[391],"2011).":[392],"By-products":[393],"average-case":[396],"include":[398],"randomness":[404],"trade-offs":[405],"as":[408,410],"well":[409],"unconditional":[412],"mild":[413],"AM.":[417]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-23T00:00:00"}