{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T02:00:48Z","timestamp":1760061648456},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642235672"},{"type":"electronic","value":"9783642235689"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23568-9_16","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T20:37:54Z","timestamp":1314736674000},"page":"200-214","source":"Crossref","is-referenced-by-count":3,"title":["Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic"],"prefix":"10.1007","author":[{"given":"William","family":"Hart","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Novocin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Bernstein, D.: Multiprecision Multiplication for Mathematicians. In: Accepted by Advances in Applied Mathematics (2001), find at \n                  \n                    http:\/\/cr.yp.to\/papers.html#m3"},{"key":"16_CR2","series-title":"Geometric Modeling: Algorithms and New Trends","first-page":"131","volume-title":"B-Form Basics","author":"C. Boor de","year":"1987","unstructured":"de Boor, C.: B-Form Basics. Geometric Modeling: Algorithms and New Trends, pp. 131\u2013148. SIAM, Philadelphia (1987)"},{"key":"16_CR3","unstructured":"Bostan, A., Salvy, B.: Fast conversion algorithms for orthogonal polynomials (preprint)"},{"key":"16_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04919-8","volume-title":"B\u00e9zier and B-Spline Techniques","author":"H. Prautzsch","year":"2002","unstructured":"Prautzsch, H., Boehm, W., Paluszny, M.: B\u00e9zier and B-Spline Techniques. Springer, Heidelberg (2002)"},{"key":"16_CR5","first-page":"217","volume-title":"Analytic Computational Complexity","author":"R. Brent","year":"1975","unstructured":"Brent, R., Kung, H.T.: \n                  \n                    \n                  \n                  $\\mathcal{O}((n \\log n)^3\/2)$\n                 Algorithms for composition and reversion of power series. In: Brent, R., Kung, H.T. (eds.) Analytic Computational Complexity, pp. 217\u2013225. Academic Press, New York (1975)"},{"key":"16_CR6","unstructured":"Cannon, J.J., Bosma, W. (eds.): Handbook of Magma Functions, 2.17th edn. (2010), \n                  \n                    http:\/\/magma.maths.usyd.edu.au\/magma"},{"key":"16_CR7","volume-title":"Modern Computer Algebra","author":"J. Gathen von zur","year":"1999","unstructured":"von zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, Cambridge (1999)"},{"issue":"3","key":"16_CR8","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/j.jsc.2003.03.001","volume":"37","author":"G. Hanrot","year":"2004","unstructured":"Hanrot, G., Zimmermann, P.: A long note on Mulder\u2019s short product. Journal of Symbolic Computation\u00a037(3), 391\u2013401 (2004)","journal-title":"Journal of Symbolic Computation"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-15582-6_18","volume-title":"Mathematical Software \u2013 ICMS 2010","author":"W. Hart","year":"2010","unstructured":"Hart, W.: Fast Library for Number Theory: an introduction. In: Fukuda, K., van der Hoeven, J., Joswig, M., Takayama, N. (eds.) ICMS 2010. LNCS, vol.\u00a06327, pp. 88\u201391. Springer, Heidelberg (2010), \n                  \n                    http:\/\/www.flintlib.org"},{"key":"16_CR10","first-page":"486","volume-title":"The Art of Computer Programming, volume 2: Seminumerical Algorithms","author":"D. Knuth","year":"1997","unstructured":"Knuth, D.: The Art of Computer Programming, volume 2: Seminumerical Algorithms, 3rd edn., pp. 486\u2013488. Addison-Wesley, Reading (1997)","edition":"3"},{"key":"16_CR11","unstructured":"Liu, W., Mann, S.: An analysis of polynomial composition algorithms, University of Waterloo Research Report CS-95-24 (1995)"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Mulders, T.: On Short Multiplications and Divisions. In: AAECC, vol.\u00a011, pp. 69\u201388 (2000)","DOI":"10.1007\/s002000000037"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-1-4612-0129-8","volume-title":"Structured matrices and polynomials: unified superfast algorithms","author":"V. Pan","year":"2001","unstructured":"Pan, V.: Structured matrices and polynomials: unified superfast algorithms, p. 81. Springer, Heidelberg (2001)"},{"key":"16_CR14","unstructured":"Shoup, V.: NTL: A Library for doing Number Theory, open-source library, \n                  \n                    http:\/\/shoup.net\/ntl\/"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23568-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T12:36:16Z","timestamp":1554122176000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23568-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642235672","9783642235689"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23568-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}