{"id":"https://openalex.org/W4256317935","doi":"https://doi.org/10.1007/bf01200056","title":"Non-deterministic exponential time has two-prover interactive protocols","display_name":"Non-deterministic exponential time has two-prover interactive protocols","publication_year":1991,"publication_date":"1991-03-01","ids":{"openalex":"https://openalex.org/W4256317935","doi":"https://doi.org/10.1007/bf01200056"},"language":"en","primary_location":{"id":"doi:10.1007/bf01200056","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01200056","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/A5014978503","display_name":"L\u00e1szl\u00f3 Babai","orcid":"https://orcid.org/0000-0002-2058-685X"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]},{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["HU","US"],"is_corresponding":false,"raw_author_name":"L\ufffdszl\ufffd Babai","raw_affiliation_strings":["E\u00f6tv\u00f6s University, Budapest, Hungary","University of Chicago, 60637, Chicago, IL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"E\u00f6tv\u00f6s University, Budapest, Hungary","institution_ids":["https://openalex.org/I106118109"]},{"raw_affiliation_string":"University of Chicago, 60637, Chicago, IL","institution_ids":["https://openalex.org/I40347166"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075191567","display_name":"Lance Fortnow","orcid":"https://orcid.org/0000-0002-2020-1358"},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lance Fortnow","raw_affiliation_strings":["Department of Computer Science, University of Chicago, 1100 E. 58th St., 60637, Chicago, IL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Chicago, 1100 E. 58th St., 60637, Chicago, IL","institution_ids":["https://openalex.org/I40347166"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022565251","display_name":"Carsten Lund","orcid":null},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Carsten Lund","raw_affiliation_strings":["Department of Computer Science, University of Chicago, 1100 E. 58th St., 60637, Chicago, IL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Chicago, 1100 E. 58th St., 60637, Chicago, IL","institution_ids":["https://openalex.org/I40347166"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":14.0359,"has_fulltext":false,"cited_by_count":459,"citation_normalized_percentile":{"value":0.9898165,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":"1","issue":"1","first_page":"3","last_page":"40"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9997000098228455,"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.9997000098228455,"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.9994000196456909,"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/T10126","display_name":"Logic, programming, and type systems","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"}}],"keywords":[{"id":"https://openalex.org/keywords/gas-meter-prover","display_name":"Gas meter prover","score":0.9411765336990356},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.6082903146743774},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.5814887285232544},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.5574623346328735},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5154119729995728},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5129210948944092},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46960386633872986},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4519684612751007},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.447092741727829},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4406723380088806},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4218078851699829},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.4100310206413269},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34068673849105835},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3226966857910156},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29511821269989014},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.2107691764831543},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14367970824241638}],"concepts":[{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.9411765336990356},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.6082903146743774},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.5814887285232544},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5574623346328735},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5154119729995728},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5129210948944092},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46960386633872986},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4519684612751007},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.447092741727829},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4406723380088806},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4218078851699829},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4100310206413269},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34068673849105835},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3226966857910156},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29511821269989014},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2107691764831543},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14367970824241638},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/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.1007/bf01200056","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01200056","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1520700928","https://openalex.org/W1594962164","https://openalex.org/W1655990431","https://openalex.org/W1964234068","https://openalex.org/W1970089350","https://openalex.org/W1970606468","https://openalex.org/W1982248598","https://openalex.org/W1996834809","https://openalex.org/W2002032317","https://openalex.org/W2006912660","https://openalex.org/W2013587815","https://openalex.org/W2033361557","https://openalex.org/W2036265926","https://openalex.org/W2053086236","https://openalex.org/W2057512592","https://openalex.org/W2077476995","https://openalex.org/W2080132708","https://openalex.org/W2080578129","https://openalex.org/W2090841650","https://openalex.org/W2096390054","https://openalex.org/W2122141283","https://openalex.org/W2127350845","https://openalex.org/W2134839489","https://openalex.org/W2144675047","https://openalex.org/W2147999468","https://openalex.org/W2148957455","https://openalex.org/W2151536080","https://openalex.org/W2165813048","https://openalex.org/W2745281314","https://openalex.org/W2963541987","https://openalex.org/W4241764762"],"related_works":["https://openalex.org/W2160227905","https://openalex.org/W2145906386","https://openalex.org/W1862457258","https://openalex.org/W2982087871","https://openalex.org/W2998650364","https://openalex.org/W2416431186","https://openalex.org/W2032606560","https://openalex.org/W2158170224","https://openalex.org/W2003513300","https://openalex.org/W1676587966"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":15},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":15},{"year":2013,"cited_by_count":17},{"year":2012,"cited_by_count":11}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}