{"id":"https://openalex.org/W2075363121","doi":"https://doi.org/10.1016/0304-3975(93)90210-k","title":"Interactive proof systems and alternating time\u2014space complexity","display_name":"Interactive proof systems and alternating time\u2014space complexity","publication_year":1993,"publication_date":"1993-05-01","ids":{"openalex":"https://openalex.org/W2075363121","doi":"https://doi.org/10.1016/0304-3975(93)90210-k","mag":"2075363121"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(93)90210-k","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(93)90210-k","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical 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/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":true,"raw_author_name":"Lance Fortnow","raw_affiliation_strings":["Department of Computer Science, University of Chicago, 1100 E. 58th Street, Chicago, IL 60637, USA","University of Chicago, Chicago, IL"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Chicago, 1100 E. 58th Street, Chicago, IL 60637, USA","institution_ids":["https://openalex.org/I40347166"]},{"raw_affiliation_string":"University of Chicago, 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 Street, Chicago, IL 60637, USA","University of Chicago, Chicago, IL"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Chicago, 1100 E. 58th Street, Chicago, IL 60637, USA","institution_ids":["https://openalex.org/I40347166"]},{"raw_affiliation_string":"University of Chicago, Chicago, IL","institution_ids":["https://openalex.org/I40347166"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075191567"],"corresponding_institution_ids":["https://openalex.org/I40347166"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":1.7464,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.86469738,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"113","issue":"1","first_page":"55","last_page":"73"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9998999834060669,"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.9998999834060669,"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.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/T11567","display_name":"semigroups and automata theory","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"}}],"keywords":[{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.9026450514793396},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.7566312551498413},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7413983345031738},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6534764170646667},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.634535551071167},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.614409327507019},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5930986404418945},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5314653515815735},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4940676987171173},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4524095356464386},{"id":"https://openalex.org/keywords/structural-complexity-theory","display_name":"Structural complexity theory","score":0.4480019509792328},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4423278272151947},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.44030120968818665},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4173041880130768},{"id":"https://openalex.org/keywords/nspace","display_name":"NSPACE","score":0.41154754161834717},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3822975158691406},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.32553815841674805},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19123488664627075},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.18299558758735657},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09797835350036621}],"concepts":[{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.9026450514793396},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.7566312551498413},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7413983345031738},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6534764170646667},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.634535551071167},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.614409327507019},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5930986404418945},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5314653515815735},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4940676987171173},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4524095356464386},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.4480019509792328},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4423278272151947},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.44030120968818665},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4173041880130768},{"id":"https://openalex.org/C201958364","wikidata":"https://www.wikidata.org/wiki/Q1756295","display_name":"NSPACE","level":5,"score":0.41154754161834717},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3822975158691406},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.32553815841674805},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19123488664627075},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.18299558758735657},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09797835350036621},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0304-3975(93)90210-k","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(93)90210-k","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.41.2001","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.2001","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://external.nj.nec.com/homepages/fortnow/papers/./ipspace.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W11770605","https://openalex.org/W1853742281","https://openalex.org/W1964053266","https://openalex.org/W1964234068","https://openalex.org/W1965166428","https://openalex.org/W1965844655","https://openalex.org/W1970606468","https://openalex.org/W1979328074","https://openalex.org/W1980879781","https://openalex.org/W1982248598","https://openalex.org/W2002089154","https://openalex.org/W2027501230","https://openalex.org/W2046176315","https://openalex.org/W2048013437","https://openalex.org/W2060975544","https://openalex.org/W2080578129","https://openalex.org/W2082647621","https://openalex.org/W2083368929","https://openalex.org/W2096390054","https://openalex.org/W2097206148","https://openalex.org/W2116215777","https://openalex.org/W2134839489","https://openalex.org/W2147999468","https://openalex.org/W2148957455","https://openalex.org/W2293988196","https://openalex.org/W2533977282","https://openalex.org/W2741390383","https://openalex.org/W2913527980","https://openalex.org/W4241108585","https://openalex.org/W4285719527","https://openalex.org/W4302339081","https://openalex.org/W6634778649","https://openalex.org/W6639105048","https://openalex.org/W6646293328","https://openalex.org/W6662327634","https://openalex.org/W6674658004"],"related_works":["https://openalex.org/W1504200807","https://openalex.org/W1520700928","https://openalex.org/W2169625092","https://openalex.org/W2048353152","https://openalex.org/W1486286946","https://openalex.org/W2951313060","https://openalex.org/W4300950794","https://openalex.org/W2122747219","https://openalex.org/W2295040078","https://openalex.org/W2098066196"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}