{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:12:37Z","timestamp":1725664357286},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540581406"},{"type":"electronic","value":"9783540484424"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":[[1994]]},"DOI":"10.1007\/3-540-58140-5_1","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:18:54Z","timestamp":1330251534000},"page":"1-7","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Lower bounds for probabilistic space complexity: Communication-automata approach"],"prefix":"10.1007","author":[{"given":"Farid","family":"Ablayev","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/3-540-56939-1_76","volume":"700","author":"F. Ablayev","year":"1993","unstructured":"F. Ablayev, Lower Bounds for one-way Probabilistic Communication Complexity, in Proc. of the ICALP-93, Lect. Notes in Comput. Sci., 1993, 700, 241\u2013252.","journal-title":"Proc. of the ICALP-93, Lect. Notes in Comput. Sci."},{"key":"1_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0016230","volume":"233","author":"F. Ablayev","year":"1986","unstructured":"F. Ablayev and R. Freivalds, Why sometimes probabilistic algorithms can be more effective, in Proc. of MFCS'86, Lecture Notes in Computer Science 1986, 233, 1\u201314.","journal-title":"Proc. of MFCS'86, Lecture Notes in Computer Science"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"R. Boppana and M. Sipser, The Complexity of Finite Functions. in Handbook of Theor. Comput. Sci. Edited by J. van Leeuwen, 1990, 759\u2013801.","DOI":"10.1016\/B978-0-444-88071-0.50019-9"},{"key":"1_CR4","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/BFb0019368","volume":"502","author":"R. Freivalds","year":"1991","unstructured":"R. Freivalds, Complexity of Probabilistic Versus Deterministic Automata, Baltic Computer Science Selected Papers, Lect. Notes in Comput. Sci. 1991, 502, 565\u2013613.","journal-title":"Lect. Notes in Comput. Sci."},{"key":"1_CR5","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","volume":"6","author":"J. Gill","year":"1977","unstructured":"J. Gill, \u201c Computational complexity of probabilistic Turing machines,\u201d SIAM J. Comput.\n6 (1977), 675\u2013695.","journal-title":"SIAM J. Comput."},{"key":"1_CR6","unstructured":"J.E. Hopcroft and J.D. Ulman, Introduction to automata theory, languages, and computation, 1979."},{"key":"1_CR7","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/BFb0029629","volume":"452","author":"J. Kaneps","year":"1990","unstructured":"J. Kaneps and R. Freivalds, Minimal nontrivial space complexity of probabilistic one-way Turing machines, in Proc. of MFCS'90, Lect. Notes in Comput. Sci. 1990, 452, 355\u2013361.","journal-title":"Proc. of MFCS'90, Lect. Notes in Comput. Sci."},{"key":"1_CR8","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1145\/321406.321410","volume":"14","author":"R.M. Karp","year":"1967","unstructured":"R.M. Karp, \u201dSome bounds on the storage requirements of sequential machines and Turing machines,\u201d Journal of the Association for Computing Machinery\n14 (1967),478\u2013489.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"R.E. Stearns, J. Hartmanis and P.M. Lewis II, \u201cHierarchies of memory limited computation,\u201d 1965 IEEE Conference Record on Switching Circuit Theory and Logical Design, (1965), 179\u2013190.","DOI":"10.1109\/FOCS.1965.11"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58140-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T18:30:15Z","timestamp":1578508215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58140-5_1"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540581406","9783540484424"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-58140-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"7 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}