{"id":"https://openalex.org/W2175404758","doi":"https://doi.org/10.1007/s00037-014-0095-y","title":"Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games","display_name":"Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games","publication_year":2014,"publication_date":"2014-10-30","ids":{"openalex":"https://openalex.org/W2175404758","doi":"https://doi.org/10.1007/s00037-014-0095-y","mag":"2175404758"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-014-0095-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-014-0095-y","pdf_url":null,"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":null,"license_id":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051279793","display_name":"Bar\u0131\u015f Ayd\u0131nl\u0131og\u0303lu","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":false,"raw_author_name":"Bar\u0131\u015f Ayd\u0131nl\u0131o\u011flu","raw_affiliation_strings":["Department of Computer Sciences, University of Wisconsin, Madison, WI, 53706, USA","Department of Computer Sciences, University of Wisconsin, Madison, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, University of Wisconsin, Madison, WI, 53706, USA","institution_ids":["https://openalex.org/I135310074"]},{"raw_affiliation_string":"Department of Computer Sciences, University of Wisconsin, Madison, USA","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"last","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":["Department of Computer Sciences, University of Wisconsin, Madison, WI, 53706, USA","Department of Computer Sciences, University of Wisconsin, Madison, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, University of Wisconsin, Madison, WI, 53706, USA","institution_ids":["https://openalex.org/I135310074"]},{"raw_affiliation_string":"Department of Computer Sciences, University of Wisconsin, Madison, USA","institution_ids":["https://openalex.org/I135310074"]}]}],"institutions":[],"countries_distinct_count":1,"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":null,"fwci":0.3656,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.66535823,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"26","issue":"1","first_page":"79","last_page":"118"},"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.9990000128746033,"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/T12288","display_name":"Optimization and Search Problems","score":0.9835000038146973,"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.771143913269043},{"id":"https://openalex.org/keywords/advice","display_name":"Advice (programming)","score":0.695021390914917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6864814758300781},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6494259834289551},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.565590500831604},{"id":"https://openalex.org/keywords/pseudorandom-number-generator","display_name":"Pseudorandom number generator","score":0.5024316310882568},{"id":"https://openalex.org/keywords/sigma","display_name":"Sigma","score":0.49965739250183105},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49926209449768066},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.498091459274292},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.4795479476451874},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2610412836074829},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.18516242504119873},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16898897290229797},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.12847495079040527}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.771143913269043},{"id":"https://openalex.org/C2779955035","wikidata":"https://www.wikidata.org/wiki/Q4686785","display_name":"Advice (programming)","level":2,"score":0.695021390914917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6864814758300781},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6494259834289551},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.565590500831604},{"id":"https://openalex.org/C140642157","wikidata":"https://www.wikidata.org/wiki/Q1623338","display_name":"Pseudorandom number generator","level":2,"score":0.5024316310882568},{"id":"https://openalex.org/C2778049214","wikidata":"https://www.wikidata.org/wiki/Q7512234","display_name":"Sigma","level":2,"score":0.49965739250183105},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49926209449768066},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.498091459274292},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4795479476451874},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2610412836074829},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.18516242504119873},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16898897290229797},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.12847495079040527},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00037-014-0095-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-014-0095-y","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},{"id":"mag:2401990252","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc19.html#AydinliogluM12","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6200000047683716,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W159330758","https://openalex.org/W987035227","https://openalex.org/W1527197079","https://openalex.org/W1541076918","https://openalex.org/W1943330086","https://openalex.org/W1984976620","https://openalex.org/W1986602165","https://openalex.org/W1996192734","https://openalex.org/W1998918799","https://openalex.org/W1999384241","https://openalex.org/W2021736779","https://openalex.org/W2026036943","https://openalex.org/W2028556586","https://openalex.org/W2036322072","https://openalex.org/W2061106457","https://openalex.org/W2082647621","https://openalex.org/W2083237534","https://openalex.org/W2092429268","https://openalex.org/W2105916316","https://openalex.org/W2107324709","https://openalex.org/W2131757234","https://openalex.org/W2148957455","https://openalex.org/W2158747250","https://openalex.org/W2168155538","https://openalex.org/W2168597683","https://openalex.org/W2183978808","https://openalex.org/W2293988196","https://openalex.org/W2998808137","https://openalex.org/W3165549676","https://openalex.org/W4298227433"],"related_works":["https://openalex.org/W1567771348","https://openalex.org/W1523547988","https://openalex.org/W1531056015","https://openalex.org/W4233053549","https://openalex.org/W2024358852","https://openalex.org/W2144557478","https://openalex.org/W1563292958","https://openalex.org/W1505947458","https://openalex.org/W2033718868","https://openalex.org/W1676587966"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}