{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:16Z","timestamp":1725662896692},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540133452"},{"type":"electronic","value":"9783540388869"}],"license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"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":[[1984]]},"DOI":"10.1007\/3-540-13345-3_25","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:02:34Z","timestamp":1330192954000},"page":"281-291","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On probabilistic tape complexity and fast circuits for matrix inversion problems"],"prefix":"10.1007","author":[{"given":"Hermann","family":"Jung","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"R.Aleliunes, R.M.Karp, R.J.Lipton, L.Lovasz, Random walks, universal traversal sequences and the complexity of maze problems. 20th Annual Symposium on Foundations of Computer Science, 1979, 218\u2013223","DOI":"10.1109\/SFCS.1979.34"},{"key":"25_CR2","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1137\/0206054","volume":"6","author":"A. Borodin","year":"1977","unstructured":"A. Borodin, On relating time and space to size and depth. SIAM J. Computing 6 (1977), 733\u2013744","journal-title":"SIAM J. Computing"},{"key":"25_CR3","unstructured":"A.Borodin, S.Cook, N.Pippenger, Parallel computation for wellendowed rings and space-bounded probabilistic machines. TR#162\/83, Dept. of Comp. Sci., University of Toronto, 1983"},{"issue":"3","key":"25_CR4","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0019-9958(82)90766-5","volume":"52","author":"A. Borodin","year":"1982","unstructured":"A. Borodin, J. von zur Gathen, J.E. Hopcroft, Fast parallel matrix and god computations. Information and Control 52, 3 (1982), 241\u2013256","journal-title":"Information and Control"},{"key":"25_CR5","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1137\/0205040","volume":"5","author":"L. Csanky","year":"1976","unstructured":"L. Csanky, Fast parallel matrix inversion algorithms. SIAM J. Computing 5 (1976), 618\u2013623","journal-title":"SIAM J. Computing"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"R.V. Freivals, Probabilistic two-way machines. 10th Symposium on Mathematical Foundations of Computer Science, 1981, LNCS 118, 33\u201345","DOI":"10.1007\/3-540-10856-4_72"},{"key":"25_CR7","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","volume":"6","author":"J. Gill","year":"1977","unstructured":"J. Gill, Computational complexity of probabilistic Turing machines. SIAM J. Computing 6 (1977), 675\u2013695","journal-title":"SIAM J. Computing"},{"key":"25_CR8","volume-title":"Formal languages and their relation to automata","author":"J. H. Hopcroft","year":"1969","unstructured":"J.H. Hopcroft, J.D. Ullman, Formal languages and their relation to automata. Addison-Wesley, Reading MA, 1969"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"H.Jung, Relationships between probabilistic and deterministic tape complexity. 10th Symposium on Mathematical Foundations of Computer Science, 1981, LNCS 118, 339\u2013346","DOI":"10.1007\/3-540-10856-4_101"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"B.Monien, I.H.Sudborough, On elimating nondeterminism from Turing machines which use less than logarithm worktape space. 6th Coll. on Automata, Languages and Programming, 1979, LNCS 71, 431\u2013445","DOI":"10.1007\/3-540-09510-1_34"},{"key":"25_CR11","volume-title":"Logarithmic depth circuits for algebraic functions. TR-35-82, Harvard Un.","author":"J. H. Reif","year":"1982","unstructured":"J.H. Reif, Logarithmic depth circuits for algebraic functions. TR-35-82, Harvard Un., Aiken Comp. Lab., Cambridge MA, 1982"},{"key":"25_CR12","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","volume":"22","author":"W. L. Ruzzo","year":"1981","unstructured":"W.L. Ruzzo, On uniform circuit complexity. Journal of Computer and System Sciences 22 (1981), 365\u2013383","journal-title":"Journal of Computer and System Sciences"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"W.L.Ruzzo, J.Simon, M.Tompa, Space-bounded hierarchies and probabilistic computations. 14th Annual ACM Symposium on Theory of Computing, 1982","DOI":"10.1145\/800070.802194"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"J.Simon, On the difference between one and many. 4th Coll. on Automata, Languages and Programming, 1977, LNCS 52, 480\u2013491","DOI":"10.1007\/3-540-08342-1_37"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"J.Simon, Space-bounded probabilistic Turing machine complexity classes are closed under complement. 13th Annual ACM Symposium on Theory of Computing, 1981, 158\u2013167","DOI":"10.1145\/800076.802469"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-13345-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:52:52Z","timestamp":1578527572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-13345-3_25"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540133452","9783540388869"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-13345-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]},"assertion":[{"value":"28 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}