{"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":1725662932257},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540108566"},{"type":"electronic","value":"9783540387695"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10856-4_79","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:32:05Z","timestamp":1330191125000},"page":"132-139","source":"Crossref","is-referenced-by-count":5,"title":["Fast parallel computation of polynomials using few processors"],"prefix":"10.1007","author":[{"given":"L. G.","family":"Valiant","sequence":"first","affiliation":[]},{"given":"S.","family":"Skyum","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"10_CR1","volume-title":"The Computational Complexity of Algebraic and Numeric Problems","author":"A. Borodin","year":"1975","unstructured":"A. Borodin and I. Munro. The Computational Complexity of Algebraic and Numeric Problems. American Elsevier, New York, 1975."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"S.A. Cook. Deterministic CFL's are accepted simultaneously in polynomial time and log squared space. Proc. 11th ACM Symp. on Theory of Computing \/1979\/ 338\u2013345.","DOI":"10.1145\/800135.804426"},{"issue":"4","key":"10_CR3","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1137\/0205040","volume":"5","author":"L. Csanky","year":"1976","unstructured":"L. Csanky. Fast parallel inversion algorithms. SIAM J. on Computing, 5:4 \/1976\/ 618\u2013623.","journal-title":"SIAM J. on Computing"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"L. Hyafil. On the parallel evaluation of multivariate polynomials. Proc. 10th ACM Symp. on Theory of Computing \/1978\/ 193\u2013195.","DOI":"10.1145\/800133.804347"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"W.L. Ruzzo. On uniform circuit complexity. Proc. 20th IEEE Symp. on Foundations of Computer Science \/1979\/ 312\u2013318.","DOI":"10.1109\/SFCS.1979.31"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"S. Skyum and L.G. Valiant. A complexity theory based on Boolean algebra. \/1981\/. To appear.","DOI":"10.1109\/SFCS.1981.3"},{"key":"10_CR7","first-page":"182","volume":"264","author":"V. Strassen","year":"1973","unstructured":"V. Strassen. Vermeidung von Divisionen. J. Reine und Angewandte Mathematik 264 \/1973\/ 182\u2013202.","journal-title":"J. Reine und Angewandte Mathematik"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"L.G. Valiant. Completeness classes in algebra. Proc. 11th ACM Symp. on Theory of Computing, \/1979\/ 249\u2013261.","DOI":"10.1145\/800135.804419"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1981"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10856-4_79.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:04:04Z","timestamp":1605643444000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10856-4_79"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540108566","9783540387695"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-10856-4_79","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}