{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:52Z","timestamp":1725662932265},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540164869"},{"type":"electronic","value":"9783540398257"}],"license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16486-3_95","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:45:19Z","timestamp":1330177519000},"page":"144-162","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Probabilistic game automata"],"prefix":"10.1007","author":[{"given":"Anne","family":"Condon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Ladner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"L. BABAI, Trading group theory for randomness, Proc. 17th ACM Symp. Theory of Computing (1985), 421\u2013429.","DOI":"10.1145\/22145.22192"},{"issue":"1","key":"11_CR2","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A. K. Chandra","year":"1981","unstructured":"A. K. CHANDRA, D.C. KOZEN AND L.J. STOCKMEYER, Alternation, J. Assoc. Comput. Mach.\n28, No. 1 (1981), 114\u2013133.","journal-title":"J. Assoc. Comput. Mach."},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1137\/0206049","volume":"6","author":"J. Gill","year":"1977","unstructured":"J. GILL, The computational complexity of probabilistic Turing machines, SIAM J. Comput.\n6 (1977), 675\u2013695.","journal-title":"SIAM J. Comput."},{"key":"11_CR4","unstructured":"C. DERMAN, Finite State Markov Decision Processes, Academic Press, 1972."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"S. GOLDWASSER, S. MICALI AND C. RACKOFF, The knowledge complexity of interactive protocols, Proc. 17th ACM Symp. Theory of Computing (1985), 291\u2013304.","DOI":"10.1145\/22145.22178"},{"key":"11_CR6","unstructured":"HOWARD, Dynamic Programming and Markov Processes, M.I.T. press, 1960."},{"key":"11_CR7","first-page":"191","volume":"20","author":"L.G. Khachiyan","year":"1979","unstructured":"L.G. KHACHIYAN, A Polynimial algorithm in linear programming, Soviet Math Dokl.\n20, (1979) 191\u2013194.","journal-title":"Soviet Math Dokl."},{"issue":"1","key":"11_CR8","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/0022-0000(85)90007-8","volume":"30","author":"R.E. Ladner","year":"1985","unstructured":"R.E. LADNER AND J.K. NORMAN, Solitaire automata, J. Comput. System Sci.\n30, No.1 (1985) 116\u2013129.","journal-title":"J. Comput. System Sci."},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"C. H. PAPADIMITRIOU, Games against nature, Proc. 24th IEE Symp. Found. Comp. Sci., (1983), 446\u2013450.","DOI":"10.1109\/SFCS.1983.20"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"G. L. PETERSON AND J. H. REIF, Multiple person alternation, Proc. 20th IEE Symp. Found. Comp. Sci., (1979), 348\u2013363.","DOI":"10.1109\/SFCS.1979.25"},{"issue":"2","key":"11_CR11","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0022-0000(84)90034-5","volume":"29","author":"J.H. Reif","year":"1984","unstructured":"J.H. REIF, The complexity of two-player games of incomplete information, J. Comput. System Sci.\n29, No.2 (1984) 274\u2013301.","journal-title":"J. Comput. System Sci."},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"M. SIPSER AND S. GOLDWASSER, Public Coins versus Private Coins in Interactive Proof Systems, Proc. 18th ACM Symp. Theory of Computing (1986).","DOI":"10.1145\/12130.12137"}],"container-title":["Lecture Notes in Computer Science","Structure in Complexity Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16486-3_95","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:21:01Z","timestamp":1578518461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16486-3_95"}},"subtitle":["Preliminary version"],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540164869","9783540398257"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-16486-3_95","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}