{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,21]],"date-time":"2024-03-21T10:40:59Z","timestamp":1711017659843},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,5,1]],"date-time":"1993-05-01T00:00:00Z","timestamp":736214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7382,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1993,5]]},"DOI":"10.1016\/0304-3975(93)90210-k","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"55-73","source":"Crossref","is-referenced-by-count":19,"title":["Interactive proof systems and alternating time\u2014space complexity"],"prefix":"10.1016","volume":"113","author":[{"given":"Lance","family":"Fortnow","sequence":"first","affiliation":[]},{"given":"Carsten","family":"Lund","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90210-K_BIB1","first-page":"421","article-title":"Trading group theory for randomness","author":"Babai","year":"1985","journal-title":"Proc. 17th ACM Symp. on the Theory of Computing"},{"key":"10.1016\/0304-3975(93)90210-K_BIB2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01200057","article-title":"Arithmetization: a new method in structural complexity theory","volume":"1","author":"Babai","year":"1991","journal-title":"Comput. Complexity"},{"key":"10.1016\/0304-3975(93)90210-K_BIB3","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0304-3975(80)90036-5","article-title":"On time-space classes and their relation to the theory of real addition","volume":"11","author":"Bruss","year":"1980","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/0304-3975(93)90210-K_BIB4","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90210-K_BIB5","first-page":"162","article-title":"Space bounded probabilistic game automata","author":"Codon","year":"1988","journal-title":"Proc. 3rd Conf. on Structure in Complexity Theory"},{"key":"10.1016\/0304-3975(93)90210-K_BIB6","series-title":"Ph.D. Thesis","article-title":"Complexity-theoretic aspects of interactive proof systems","author":"Fortnow","year":"1989"},{"key":"10.1016\/0304-3975(93)90210-K_BIB7","article-title":"Interactive proof systems with a log space verifier","author":"Fortnow","year":"1988","journal-title":"manuscript"},{"key":"10.1016\/0304-3975(93)90210-K_BIB8","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0020-0190(88)90199-8","article-title":"Are there interactive protocols for co-NP languages?","volume":"28","author":"Fortnow","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(93)90210-K_BIB9","first-page":"148","article-title":"Probabilistic computation and linear time","author":"Fortnow","year":"1989","journal-title":"Proc. 21st ACM Symp. on the Theory of Computing"},{"issue":"1","key":"10.1016\/0304-3975(93)90210-K_BIB10","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","article-title":"The knowledge complexity of interactive proof-systems","volume":"18","author":"Goldwasser","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90210-K_BIB11","first-page":"73","article-title":"Private coins versus public coins in interactive proof systems","volume":"Vol. 5","author":"Goldwasser","year":"1989"},{"key":"10.1016\/0304-3975(93)90210-K_BIB12","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"issue":"4","key":"10.1016\/0304-3975(93)90210-K_BIB13","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1145\/321724.321727","article-title":"A note concerning nondeterministic tape complexities","volume":"19","author":"Ibarra","year":"1972","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/0304-3975(93)90210-K_BIB14","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1145\/146585.146605","article-title":"Algebraic methods for interactive proof systems","volume":"39","author":"Lund","year":"1992","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90210-K_BIB15","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF00264255","article-title":"On alternation","volume":"14","author":"Paul","year":"1980","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(93)90210-K_BIB16","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","article-title":"On uniform circuit complexity","volume":"22","author":"Ruzzo","year":"1981","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"10.1016\/0304-3975(93)90210-K_BIB17","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1145\/146585.146609","article-title":"IP = PSPACE","volume":"39","author":"Shamir","year":"1992","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90210-K_BIB18_1","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1137\/0206006","article-title":"A fast Monte-Carlo test for primality","volume":"6","author":"Solovay","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90210-K_BIB18_2","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1137\/0207009","article-title":"A fast Monte-Carlo test for primality","volume":"7","author":"Solovay","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90210-K_BIB19","first-page":"493","article-title":"Time and tape bounded auxiliary pushdown automata","author":"Sudborough","year":"1977","journal-title":"Math. Foundations Comput. Sci."},{"issue":"3","key":"10.1016\/0304-3975(93)90210-K_BIB20","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1145\/322077.322083","article-title":"On the tape complexity of deterministic context free languages","volume":"25","author":"Sudborough","year":"1978","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390210K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390210K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:22:50Z","timestamp":1555114970000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390210K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,5]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,5]]}},"alternative-id":["030439759390210K"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90210-k","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,5]]}}}