{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T13:58:35Z","timestamp":1769003915991,"version":"3.49.0"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1980,3,1]],"date-time":"1980-03-01T00:00:00Z","timestamp":320716800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1980,3]]},"DOI":"10.1007\/bf02242791","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T14:27:37Z","timestamp":1131978457000},"page":"51-60","source":"Crossref","is-referenced-by-count":13,"title":["On the complexity of algorithms for the translation of polynomials","\u00dcber die Komplexit\u00e4t von Algorithmen zur Entwicklung von Polynomen"],"prefix":"10.1007","volume":"24","author":[{"given":"A. G.","family":"Akritas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. D.","family":"Danielopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02242791_CR1","volume-title":"The design and analysis of computer algorithms","author":"A. V. Aho","year":"1974","unstructured":"Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The design and analysis of computer algorithms. Reading-Menlo Park-London-Amsterdam: Addison-Wesley 1974."},{"key":"BF02242791_CR2","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1137\/0204045","volume":"4","author":"A. V. Aho","year":"1975","unstructured":"Aho, A. V., Steiglitz, K., Ullman, J. D.: Evaluating polynomials at fixed sets of points. SIAM J. Comput.4, 533\u2013539 (1975).","journal-title":"SIAM J. Comput."},{"key":"BF02242791_CR3","doi-asserted-by":"crossref","unstructured":"Akritas, A. G.: A new method for polynomial real root isolation. Proc. 16th Annual Southeast Regional ACM Conference, Atlanta, April 13\u201315, 39\u201343 (1978).","DOI":"10.1145\/503643.503653"},{"key":"BF02242791_CR4","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/0315-0860(78)90211-2","volume":"5","author":"A. G. Akritas","year":"1978","unstructured":"Akritas, A. G., Danielopoulos, S. D.: On the forgotten theorem of Mr. Vincent. Historia Mathematica5, 427\u2013435 (1978).","journal-title":"Historia Mathematica"},{"key":"BF02242791_CR5","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1090\/S0002-9904-1911-02072-9","volume":"17","author":"F. Cajori","year":"1911","unstructured":"Cajori, F.: Horner's method of approximation anticipated by Ruffini. Amer. Mathem. Soc. Bull.17, 409\u2013414 (1911).","journal-title":"Amer. Mathem. Soc. Bull."},{"key":"BF02242791_CR6","first-page":"108","volume":"1","author":"W. G. Horner","year":"1845","unstructured":"Horner, W. G.: On algebraic transformation. The Mathematician (London)1, 108\u2013112, 136\u2013142, 311\u2013316 (1845).","journal-title":"The Mathematician (London)"},{"key":"BF02242791_CR7","volume-title":"The art of computer programming, Vol. 1: Fundamental algorithms","author":"D. E. Knuth","year":"1973","unstructured":"Knuth, D. E.: The art of computer programming, Vol. 1: Fundamental algorithms, 2nd ed. Reading-Menlo Park-London-Don Mills: Addison-Wesley 1973.","edition":"2nd ed."},{"key":"BF02242791_CR8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF02243620","volume":"18","author":"H. R. Schwarz","year":"1977","unstructured":"Schwarz, H. R.: Elementare Darstellung der schnellen Fouriertransformation. Computing18, 107\u2013116 (1977).","journal-title":"Computing"},{"key":"BF02242791_CR9","first-page":"341","volume":"1","author":"Vincent","year":"1836","unstructured":"Vincent: Sur la r\u00e9solution des \u00e9quations num\u00e9riques. Journal de Math\u00e9matiques Pures et Appliqu\u00e9es1, 341\u2013372 (1836).","journal-title":"Journal de Math\u00e9matiques Pures et Appliqu\u00e9es"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02242791.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02242791\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02242791","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T19:27:34Z","timestamp":1557862054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02242791"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,3]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1980,3]]}},"alternative-id":["BF02242791"],"URL":"https:\/\/doi.org\/10.1007\/bf02242791","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,3]]}}}