{"id":"https://openalex.org/W2098324348","doi":"https://doi.org/10.1007/s00037-005-0197-7","title":"Derandomizing Arthur\u2013Merlin Games using Hitting Sets","display_name":"Derandomizing Arthur\u2013Merlin Games using Hitting Sets","publication_year":2005,"publication_date":"2005-12-01","ids":{"openalex":"https://openalex.org/W2098324348","doi":"https://doi.org/10.1007/s00037-005-0197-7","mag":"2098324348"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-005-0197-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-005-0197-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-005-0197-7.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-nc","license_id":"https://openalex.org/licenses/cc-by-nc","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-005-0197-7.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006968747","display_name":"Peter Bro Miltersen","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Peter Bro Miltersen","raw_affiliation_strings":["Department of Computer Science, University of Aarhus, IT-parken, Aabogade 34, Aarhus N, DK-8200, Denmark","Dept. of Computer Science, University of Aarhus, Aarhus N, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Aarhus, IT-parken, Aabogade 34, Aarhus N, DK-8200, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"Dept. of Computer Science, University of Aarhus, Aarhus N, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031088478","display_name":"N. V. Vinodchandran","orcid":"https://orcid.org/0000-0001-7959-4662"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"N. V. Vinodchandran","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, 68588, NE, U.S.A","Department of Computer Science and Engineering University of Nebraska - Lincoln, Lincoln, NE"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, 68588, NE, U.S.A","institution_ids":["https://openalex.org/I114395901"]},{"raw_affiliation_string":"Department of Computer Science and Engineering University of Nebraska - Lincoln, Lincoln, NE","institution_ids":["https://openalex.org/I114395901"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006968747"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":3.5022,"has_fulltext":true,"cited_by_count":76,"citation_normalized_percentile":{"value":0.9322242,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"14","issue":"3","first_page":"256","last_page":"279"},"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.9998000264167786,"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.9998000264167786,"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.9955000281333923,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9922999739646912,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8663620948791504},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5142404437065125},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4921993315219879},{"id":"https://openalex.org/keywords/singleton","display_name":"Singleton","score":0.4820626378059387},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4404640793800354},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4204859733581543},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.4174412488937378},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4170665144920349},{"id":"https://openalex.org/keywords/pseudorandom-number-generator","display_name":"Pseudorandom number generator","score":0.41021719574928284},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2808821499347687},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.10110741853713989},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07803481817245483}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8663620948791504},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5142404437065125},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4921993315219879},{"id":"https://openalex.org/C117354338","wikidata":"https://www.wikidata.org/wiki/Q1165112","display_name":"Singleton","level":3,"score":0.4820626378059387},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4404640793800354},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4204859733581543},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.4174412488937378},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4170665144920349},{"id":"https://openalex.org/C140642157","wikidata":"https://www.wikidata.org/wiki/Q1623338","display_name":"Pseudorandom number generator","level":2,"score":0.41021719574928284},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2808821499347687},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.10110741853713989},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07803481817245483},{"id":"https://openalex.org/C2779234561","wikidata":"https://www.wikidata.org/wiki/Q11995","display_name":"Pregnancy","level":2,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00037-005-0197-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-005-0197-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-005-0197-7.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-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/17c64540-c5f9-11db-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/17c64540-c5f9-11db-bee9-02004c4f4f50","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Miltersen, P B & Vinodchandran, N V 2005, 'Derandomizing Arthur-Merlin Games using Hitting Sets', Computational Complexity, vol. 14, no. 3, pp. 256-279. https://doi.org/10.1007/s00037-005-0197-7","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s00037-005-0197-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-005-0197-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-005-0197-7.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-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.4300000071525574}],"awards":[{"id":"https://openalex.org/G311403173","display_name":"Studies in Computational Complexity Theory","funder_award_id":"0430991","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/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"},{"id":"https://openalex.org/F4320320943","display_name":"Danmarks Grundforskningsfond","ror":"https://ror.org/00znyv691"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2098324348.pdf","grobid_xml":"https://content.openalex.org/works/W2098324348.grobid-xml"},"referenced_works_count":68,"referenced_works":["https://openalex.org/W25285532","https://openalex.org/W110662037","https://openalex.org/W290872411","https://openalex.org/W1517959386","https://openalex.org/W1538202704","https://openalex.org/W1547702496","https://openalex.org/W1558847040","https://openalex.org/W1563159456","https://openalex.org/W1572772224","https://openalex.org/W1594093559","https://openalex.org/W1594883013","https://openalex.org/W1626447266","https://openalex.org/W1858119873","https://openalex.org/W1901622511","https://openalex.org/W1907609371","https://openalex.org/W1943330086","https://openalex.org/W1967175855","https://openalex.org/W1973322735","https://openalex.org/W1977292605","https://openalex.org/W1984976620","https://openalex.org/W1988127406","https://openalex.org/W1992499648","https://openalex.org/W1998918799","https://openalex.org/W2011112377","https://openalex.org/W2021652795","https://openalex.org/W2021736779","https://openalex.org/W2024411274","https://openalex.org/W2025819235","https://openalex.org/W2027528470","https://openalex.org/W2053086236","https://openalex.org/W2061106457","https://openalex.org/W2068751483","https://openalex.org/W2070437169","https://openalex.org/W2082571280","https://openalex.org/W2083237534","https://openalex.org/W2096390054","https://openalex.org/W2103517359","https://openalex.org/W2111978056","https://openalex.org/W2114150121","https://openalex.org/W2138109426","https://openalex.org/W2140441560","https://openalex.org/W2148368275","https://openalex.org/W2148957455","https://openalex.org/W2155506366","https://openalex.org/W2158747250","https://openalex.org/W2160403361","https://openalex.org/W2161535207","https://openalex.org/W2162763810","https://openalex.org/W2164284862","https://openalex.org/W2171847006","https://openalex.org/W2335996541","https://openalex.org/W2346085253","https://openalex.org/W2402054513","https://openalex.org/W2504959571","https://openalex.org/W2571236692","https://openalex.org/W2611439785","https://openalex.org/W2741390383","https://openalex.org/W2998808137","https://openalex.org/W3150645827","https://openalex.org/W4213009134","https://openalex.org/W4233444803","https://openalex.org/W4234012207","https://openalex.org/W6609165609","https://openalex.org/W6611612081","https://openalex.org/W6636609601","https://openalex.org/W6656816045","https://openalex.org/W6663609517","https://openalex.org/W6667651285"],"related_works":["https://openalex.org/W747331120","https://openalex.org/W2351588585","https://openalex.org/W4233660055","https://openalex.org/W2076370897","https://openalex.org/W2898732469","https://openalex.org/W1555347172","https://openalex.org/W1629505938","https://openalex.org/W2155075753","https://openalex.org/W2269169662","https://openalex.org/W1606810574"],"abstract_inverted_index":{"We":[0],"prove":[1],"that":[2,88],"AM":[3,58],"(and":[4],"hence":[5],"Graph":[6],"Nonisomorphism)":[7],"is":[8,68,91,110],"in":[9,19,113],"NP":[10],"if":[11,108],"for":[12,103],"some":[13,17,104],"\u03b5":[14,105],">":[15,106],"0,":[16,107],"language":[18,112],"NE":[20],"\u2229":[21],"coNE":[22],"requires":[23,116],"nondeterministic":[24,117,141],"circuits":[25,118,139],"of":[26,33,38,73,99,119],"size":[27,120],"2\u03b5":[28,121],"n":[29,122],"This":[30,128],"improves":[31],"results":[32,55],"Arvind":[34],"and":[35,37,40,76,132],"K\u00f6bler":[36],"Klivans":[39],"van":[41],"Melkebeek":[42],"who":[43],"proved":[44],"the":[45,100],"same":[46],"conclusion,":[47],"but":[48],"under":[49],"stronger":[50],"hardness":[51],"assumptions.":[52],"The":[53],"previous":[54],"on":[56,61,70],"derandomizing":[57],"were":[59],"based":[60,69],"pseudorandom":[62],"generators.":[63],"In":[64],"contrast,":[65],"our":[66],"approach":[67,80,90],"a":[71,84,111],"strengthening":[72],"Andreev,":[74],"Clementi":[75],"Rolim\u2019s":[77],"hitting":[78],"set":[79],"to":[81,94],"derandomization.":[82],"As":[83],"spin-off,":[85],"we":[86],"show":[87],"this":[89],"strong":[92],"enough":[93],"give":[95],"an":[96],"easy":[97],"proof":[98],"following":[101],"implication:":[102],"there":[109],"E":[114],"which":[115],",":[123],"then":[124],"P":[125],"=":[126],"BPP.":[127],"differs":[129],"from":[130],"Impagliazzo":[131],"Wigderson\u2019s":[133],"theorem":[134],"\u201conly\u201d":[135],"by":[136],"replacing":[137],"deterministic":[138],"with":[140],"ones.":[142]},"counts_by_year":[{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}