{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:48Z","timestamp":1725664248958},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540580782"},{"type":"electronic","value":"9783540484356"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58078-6_4","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:10:45Z","timestamp":1330251045000},"page":"35-44","source":"Crossref","is-referenced-by-count":0,"title":["On the parallel complexity of iterated multiplication in rings of algebraic integers"],"prefix":"10.1007","author":[{"given":"Stephan","family":"Waack","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"4","key":"4_CR1","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1137\/0215070","volume":"15","author":"P. W. Beame","year":"1986","unstructured":"P. W. Beame, S. A. Cook, H. J. Hoover, Logdepth circuits for division and related problems, SIAM J. Computing 1986, 15(4), pp. 993\u20131003.","journal-title":"SIAM J. Computing"},{"key":"4_CR2","unstructured":"A. Borodin, S. A. Cook, N. Pippenger, Parallel computation for well-endowed rings and space bounded probabilistic machines, TR 162\/83, University of Toronto."},{"key":"4_CR3","volume-title":"Lecture Notes in Computer Sci. 158","author":"S. A. Cook","year":"1983","unstructured":"S. A. Cook, The classification of problems which have fast parallel algorithms, in: Lecture Notes in Computer Sci. 158, Springer-Verlag, Berlin, 1983."},{"key":"4_CR4","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","volume":"64","author":"S. A. Cook","year":"1985","unstructured":"S. A. Cook, A taxonomie of problems with fast parallel algorithms, Information and Control 1985, 64. pp. 2\u201322.","journal-title":"Information and Control"},{"issue":"2","key":"4_CR5","first-page":"880","volume":"16","author":"S. A. Cook","year":"1987","unstructured":"S. A. Cook, P. McKenzie, The parallel complexity of abelian permutation group problems, SIAM J. Computing 1987, 16(2) pp. 880\u2013909.","journal-title":"SIAM J. Computing"},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0196-6774(87)90018-6","volume":"8","author":"S. A. Cook","year":"1987","unstructured":"S. A. Cook, P. McKenzie, Problems complete for deterministic logspace, J. of Algorithms 1987, 8 pp. 385\u2013394.","journal-title":"J. of Algorithms"},{"key":"4_CR7","volume-title":"Introduction to automata theory, languages, and computation","author":"J. E. Hopcroft","year":"1979","unstructured":"J. E. Hopcroft, J. D. Ullman, Introduction to automata theory, languages, and computation, Addison-Wesley, Reading, 1979."},{"key":"4_CR8","volume-title":"Algebra","author":"S. Lang","year":"1965","unstructured":"S. Lang, Algebra, Addison-Wesley, Reading 1965"},{"issue":"1","key":"4_CR9","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1137\/0215017","volume":"15","author":"J. H. Reif","year":"1986","unstructured":"J. H. Reif, Logarithmic depth circuits for algebraic functions, SLAM J. Computing 1986, 15 (1), pp. 231\u2013242.","journal-title":"SLAM J. Computing"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"J. H. Reif, S. Tate, Optimal size integer division circuits, in: Proc. 21st ACM STOC 1989, pp. 264\u2013273.","DOI":"10.1145\/73007.73032"},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/1034049","volume":"34-2","author":"V. Pan","year":"1992","unstructured":"V. Pan, Complexity of computations with matrices and polynomials, SIAM review 1992, 34-2, pp. 225\u2013262.","journal-title":"SIAM review"},{"key":"4_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, J. Comput. System Sci. 1981, 22, pp.365\u2013383.","journal-title":"J. Comput. System Sci."},{"key":"4_CR13","volume-title":"The complexity of computing","author":"J. E. Savage","year":"1976","unstructured":"J. E. Savage, The complexity of computing, John Wiley, New York 1976."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"I. Wegener, The complexity of Boolean functions, Wiley-Teubner Series in Comput. Sci., 1987.","DOI":"10.1007\/3-540-18170-9_185"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Computing Theory and Practice"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58078-6_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:16:46Z","timestamp":1605629806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58078-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580782","9783540484356"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-58078-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}