{"id":"https://openalex.org/W2171810823","doi":"https://doi.org/10.1142/s0129054105003819","title":"NONDETERMINISTIC CIRCUIT MINIMIZATION PROBLEM AND DERANDOMIZING ARTHUR-MERLIN GAMES","display_name":"NONDETERMINISTIC CIRCUIT MINIMIZATION PROBLEM AND DERANDOMIZING ARTHUR-MERLIN GAMES","publication_year":2005,"publication_date":"2005-12-01","ids":{"openalex":"https://openalex.org/W2171810823","doi":"https://doi.org/10.1142/s0129054105003819","mag":"2171810823"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054105003819","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054105003819","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/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":true,"raw_author_name":"N. V. VINODCHANDRAN","raw_affiliation_strings":["Department of Computer Science  and Engineering, University of Nebraska-Lincoln, USA","Department of Computer Science and Engineering, University of Nebraska-Lincoln, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science  and Engineering, University of Nebraska-Lincoln, USA","institution_ids":["https://openalex.org/I114395901"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Nebraska-Lincoln, USA","institution_ids":["https://openalex.org/I114395901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5031088478"],"corresponding_institution_ids":["https://openalex.org/I114395901"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.21040747,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"16","issue":"06","first_page":"1297","last_page":"1308"},"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.9997000098228455,"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.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9933000206947327,"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.9890999794006348,"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.8362178802490234},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5588066577911377},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5246432423591614},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49594029784202576},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48444607853889465},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.4480580985546112},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4442923367023468},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3845044672489166},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3426046371459961},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.21350157260894775}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8362178802490234},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5588066577911377},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5246432423591614},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49594029784202576},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48444607853889465},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.4480580985546112},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4442923367023468},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3845044672489166},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3426046371459961},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.21350157260894775},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054105003819","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054105003819","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.5299999713897705,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W619004858","https://openalex.org/W1989903304","https://openalex.org/W1998918799","https://openalex.org/W2021652795","https://openalex.org/W2024411274","https://openalex.org/W2082571280","https://openalex.org/W2083237534","https://openalex.org/W2148957455","https://openalex.org/W2158747250","https://openalex.org/W2164284862","https://openalex.org/W2998808137","https://openalex.org/W3165549676","https://openalex.org/W4213009134","https://openalex.org/W4230561438","https://openalex.org/W4243643814","https://openalex.org/W4254548979"],"related_works":["https://openalex.org/W2808944898","https://openalex.org/W149527954","https://openalex.org/W2132176787","https://openalex.org/W2898732469","https://openalex.org/W1555347172","https://openalex.org/W1629505938","https://openalex.org/W2155075753","https://openalex.org/W2269169662","https://openalex.org/W2029100403","https://openalex.org/W1606810574"],"abstract_inverted_index":{"We":[0,19,89],"investigate":[1],"the":[2,33,58],"complexity":[3,34],"of":[4,35,45,87,93],"strong":[5],"nondeterministic":[6],"circuit":[7],"minimization":[8],"problem":[9,73,83],"(SNCMP":[10],"in":[11,13],"short)":[12],"relation":[14],"to":[15,99],"derandomizing":[16],"Arthur-Merlin":[17,24,46],"games.":[18],"show":[20,62,79],"derandomization":[21,44],"results":[22],"for":[23,68],"games":[25,47],"under":[26,74],"both":[27],"easiness":[28],"and":[29,95],"hardness":[30,50],"assumptions":[31,51],"about":[32],"SNCMP.":[36],"Assuming":[37],"SNCMP":[38,65],"is":[39,54,66],"non-uniformly":[40],"easy,":[41],"we":[42,61],"present":[43],"using":[48],"weaker":[49],"than":[52],"what":[53],"currently":[55],"known.":[56],"On":[57],"other":[59],"hand,":[60],"that":[63,80],"establishing":[64],"hard":[67],"SAT":[69],"or":[70],"Graph":[71,81],"Isomorphism":[72],"certain":[75],"natural":[76],"reductions":[77],"will":[78],"Nonisomorphism":[82],"has":[84],"subexponential":[85],"proofs":[86],"membership.":[88],"combine":[90],"known":[91],"constructions":[92],"pseudorandom":[94],"hitting":[96],"set":[97],"generators":[98],"prove":[100],"our":[101],"results.":[102]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}