{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:21:29Z","timestamp":1737436889474,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424963"},{"type":"electronic","value":"9783540446835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44683-4_17","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T01:32:38Z","timestamp":1188351158000},"page":"186-197","source":"Crossref","is-referenced-by-count":0,"title":["Computing Reciprocals of Bivariate Power Series"],"prefix":"10.1007","author":[{"given":"Markus","family":"Bl\u00e4ser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(81)90070-0","volume":"15","author":"A. Alder","year":"1981","unstructured":"A. Alder and V. Strassen. On the algorithmic complexity of associative algebras. Theoret. Comput. Sci., 15:201\u2013211, 1981.","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Markus Bl\u00e4ser. Bivariate polynomial multiplication. In Proc. 39th Ann. IEEE Symp. on Foundations of Comput. Sci. (FOCS), pages 186\u2013191, 1998.","DOI":"10.1109\/SFCS.1998.743442"},{"key":"17_CR3","unstructured":"Markus Bl\u00e4ser. On the number of multiplications needed to invert a monic power series over fields of characteristic two. Technical report, Institut f\u00fcr Informatik II, Universit\u00e4t Bonn, January 2000."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Peter B\u00fcrgisser, Michael Clausen, and M. Amin Shokrollahi. Algebraic Complexity Theory. Springer, 1997.","DOI":"10.1007\/978-3-662-03338-8"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1137\/0222037","volume":"22","author":"K. Kalorkoti","year":"1993","unstructured":"K. Kalorkoti. Inverting polynomials and formal power series. SIAM J. Comput., 22:552\u2013559, 1993.","journal-title":"SIAM J. Comput."},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF01436917","volume":"22","author":"H. T. Kung","year":"1974","unstructured":"H. T. Kung. On computing reciprocals of power series. Numer. Math., 22:341\u2013348, 1974.","journal-title":"Numer. Math."},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1070\/RM1966v021n01ABEH004147","volume":"21","author":"V. Ya. Pan","year":"1966","unstructured":"Victor Ya. Pan. Methods for computing values of polynomials. Russ. Math. Surv., 21:105\u2013136, 1966.","journal-title":"Russ. Math. Surv."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Arnold Sch\u00f6nhage. Bivariate polynomial multiplication patterns. In Proc. 11th Applied Algebra and Error Correcting Codes Conf. (AAECC), Lecture Notes in Comput. Sci. 948, pages 70\u201381. Springer, 1995.","DOI":"10.1007\/3-540-60114-7_5"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Arnold Sch\u00f6nhage. Multiplicative complexity of Taylor shifts and a new twist of the substitution method. In Proc. 39th Ann. IEEE Symp. on Foundations of Comput. Sci. (FOCS), pages 212\u2013215, 1998.","DOI":"10.1109\/SFCS.1998.743445"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0020-0190(00)00044-2","volume":"74","author":"A. Sch\u00f6nhage","year":"2000","unstructured":"Arnold Sch\u00f6nhage. Variations on computing reciprocals of power series. Inf. Proc. Letters, 74:41\u201346, 2000.","journal-title":"Inf. Proc. Letters"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF02242389","volume":"10","author":"M. Sieveking","year":"1972","unstructured":"Malte Sieveking. An algorithm for division of power series. Computing, 10:153\u2013156, 1972.","journal-title":"Computing"},{"key":"17_CR12","first-page":"184","volume":"264","author":"V. Strassen","year":"1973","unstructured":"Volker Strassen. Vermeidung von Divisionen. J. Reine Angew. Math., 264:184\u2013202, 1973.","journal-title":"J. Reine Angew. Math."},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Volker Strassen. Algebraic complexity theory. In J. van Leeuven, editor, Handbook of Theoretical Computer Science Vol. A, pages 634\u2013672. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88071-0.50016-3"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44683-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:27:54Z","timestamp":1737397674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44683-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424963","9783540446835"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44683-4_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}