{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:25:37Z","timestamp":1725456337456},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634379"},{"type":"electronic","value":"9783540695479"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0029952","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:24:59Z","timestamp":1133418299000},"page":"91-107","source":"Crossref","is-referenced-by-count":0,"title":["Computational limitations of Stochastic Turing machines and Arthur-Merlin games with small space bounds"],"prefix":"10.1007","author":[{"given":"Maciej","family":"Li\u015bkiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00fcdiger","family":"Reischuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"L. Babai, Trading Group Theory for Randomness, Proc. 17. ACM Symp. on Theory of Computing, 1985, 421\u2013429.","DOI":"10.1145\/22145.22192"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01271368","volume":"3","author":"B. Braunmiihl von","year":"1993","unstructured":"B. von Braunmiihl, R. Gengler, R. Rettinger The Alternation Hierarchy for Machines with Sublogarithmic Space is Infinite, Comp. Compl. 3, 1993, 207\u2013230.","journal-title":"Comp. Compl."},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A. Chandra","year":"1981","unstructured":"A. Chandra, D. Kozen, L. Stockmeyer, Alternation, J. ACM 28, 1981, 114\u2013133.","journal-title":"J. ACM"},{"key":"9_CR4","unstructured":"A. Condon, Computational Model of Games, MIT Press, 1989."},{"key":"9_CR5","unstructured":"A. Condon, The Complexity of Space Bounded Interactive Proof Systems, in Complexity Theory: Current Research, S. Homer, U. Sch\u00f6ning, K. Ambos-Spies (Eds.), Cambridge Univ. Press, 1993, 147\u2013190."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"A. Condon, R. Lipton, On the Complexity of Space Bounded Interactive Proofs, Proc. 30. IEEE Symp. on Found. of Comp. Science, 1989, 462\u2013467.","DOI":"10.1109\/SFCS.1989.63519"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"A. Condon, L. Hellerstein, S. Pottle, A. Wigderson, On the Power of Finite Automata with both Nondeterministic and Probabilistic States, Proc. 26. ACM Symp. on Theory of Computing, 1994, 676\u2013685.","DOI":"10.1145\/195058.195431"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1145\/146585.146599","volume":"39","author":"S. Dwork","year":"1992","unstructured":"S. Dwork, L. Stockmeyer, Finite State Verifiers L the Power of Interaction, J. ACM 39, 1992, 800\u2013828.","journal-title":"J. ACM"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"R. Freivalds, Fast Probabilistic Algorithms, Proc. 8. Int. Symp. on Math. Found. of Comp. Science, 1979, LNCS, 57\u201369.","DOI":"10.1007\/3-540-09526-8_5"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"R. Freivalds, Probabilistic 2-way Machines, Proc. 10. Int. Symp. on Math. Found. of Comp. Science, 1981, LNCS, 33\u201345.","DOI":"10.1007\/3-540-10856-4_72"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"R. Freivalds, M. Karpinski, Lower Space Bounds for Randomized Computation, Proc. 21. EATCS Int. Colloq. on Automata, Languages, and Programming, 1994, LNCS, 580\u2013592.","DOI":"10.1007\/3-540-58201-0_100"},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1051\/ita\/1994280504651","volume":"28","author":"V. Geffert","year":"1994","unstructured":"V. Geffert, A Hierarchy that Does not Collaps: Alternation in Low Level Space, Theo. Information and Applications 28, 1994, 465\u2013512.","journal-title":"Theo. Information and Applications"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/0022-0000(86)90045-0","volume":"33","author":"A. Greenberg","year":"1986","unstructured":"A. Greenberg, A. Weiss, A Lower Bound for Probabilistic Algorithms for Finite State Machines, J. Comput. Syst. Sci. 33, 1986, 88\u2013105.","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1137\/0206049","volume":"7","author":"J. Gill","year":"1977","unstructured":"J. Gill, Computational Complexity of Probabilistic Turing Machines, SIAM J. Computing 7, 1977, 675\u2013695.","journal-title":"SIAM J. Computing"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, C. Rackoff, The Knowledge Complexity of Interactive Proof Systems, SIAM J. Computing 18, 1989, 186\u2013208.","journal-title":"SIAM J. Computing"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, M. Sipser, Private Coins versus Public Coins in Interactive Proof Systems, Proc. 18. ACM Symp. on Theory of Computing, 1986, 59\u201368.","DOI":"10.1145\/12130.12137"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1137\/0222011","volume":"22","author":"K. Iwama","year":"1993","unstructured":"K. Iwama, ASpace (o(log log n)) is Regular, SIAM J. Computing 22,1993,136\u2013146.","journal-title":"SIAM J. Computing"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"M. Li\u015bkiewicz, Interactive Proof Systems with Public Coins: Lower Space Bounds and Hierarchies of Complexity Classes, ICSI Technical Report 1996, also Proc. 14. GI-AFCET Symp. on Theo. Aspects of Comp. Science, 1997, LNCS 1200,129\u2013140.","DOI":"10.1007\/BFb0023454"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"M. Liskiewicz, R. Reischuk, Separating the Lower Levels of the Sublogarithmic Space Hierarchy, Proc. 10. GI-AFCET Symp. on Theo. Aspects of Comp. Science, 1993, LNCS, 16\u201327.","DOI":"10.1007\/3-540-56503-5_4"},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1137\/S0097539793252444","volume":"24","author":"M. Liskiewicz","year":"1996","unstructured":"M. Liskiewicz, R. Reischuk, The Sublogarithmic Alternating Space World, SIAM J. Computing 24, 1996, 828\u2013861.","journal-title":"SIAM J. Computing"},{"key":"9_CR21","unstructured":"M. Liskiewicz and R. Reischuk, Space Bounds for Interactive Proof Systems with Public Coins and Bounded Number of Rounds, ICSI Technical Report No. TR-96-025, Berkeley, July 1996."},{"key":"9_CR22","unstructured":"M. Liskiewicz and R. Reischuk, Separating Small Space Complexity Classes of Stochastic Turing Machines, Technical Report Informatik\/Mathematik A-96-17, Med. Universit\u00e4t zu L\u210feck, November 1997."},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"M. Liskiewicz and R. Reischuk, Computing with Sublogarithmic Space, in Complexity Theory Retrospective II, A. Selman, L. Hemaspaandra (Eds), Springer Verlag, 1997.","DOI":"10.1007\/978-1-4612-1872-2_9"},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/211542.211543","volume":"26","author":"I. Macarie","year":"1995","unstructured":"I. Macarie, Space-bounded Probabilistic Computation: Old and New Stories, SIGACT News 26, 1995, 2\u201312.","journal-title":"SIGACT News"},{"key":"9_CR25","first-page":"288","volume":"31","author":"C. Papadimitriou","year":"1985","unstructured":"C. Papadimitriou, Games against Nature, J. CSS 31, 1985, 288\u2013301.","journal-title":"J. CSS"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029952","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:22:45Z","timestamp":1586593365000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029952"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634379","9783540695479"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/bfb0029952","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}