{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T06:26:00Z","timestamp":1648707960865},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1983,3,1]],"date-time":"1983-03-01T00:00:00Z","timestamp":415324800000},"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":[[1983,3]]},"DOI":"10.1007\/bf02253296","type":"journal-article","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T15:36:51Z","timestamp":1132673811000},"page":"63-76","source":"Crossref","is-referenced-by-count":3,"title":["Exact algorithms for polynomial real root approximation using continued fractions"],"prefix":"10.1007","volume":"30","author":[{"given":"A. G.","family":"Akritas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. Ng","family":"King","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02253296_CR1","volume-title":"The design and analysis of computer algorithms","author":"A. V. Aho","year":"1976","unstructured":"Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The design and analysis of computer algorithms. Reading: Addison-Wesley 1976."},{"key":"BF02253296_CR2","first-page":"278","volume":"19","author":"A. G. Akritas","year":"1978","unstructured":"Akritas, A. G.: A correction on a theorem by Uspensky. Bulletin of the Greek Mathematical Society19, 278\u2013285 (1978).","journal-title":"Bulletin of the Greek Mathematical Society"},{"key":"BF02253296_CR3","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/BF02237816","volume":"24","author":"A. G. Akritas","year":"1980","unstructured":"Akritas, A. G.: The fastest exact algorithms for the isolation of the real roots of a polynomial equation. Computing24, 299\u2013313 (1980).","journal-title":"Computing"},{"issue":"No. 1","key":"BF02253296_CR4","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/1089242.1089243","volume":"15","author":"A. G. Akritas","year":"1981","unstructured":"Akritas, A. G.: On the Budan-Fourier controversy. ACM-SIGSAM Bulletin15, No. 1, 8\u201310 (1981).","journal-title":"ACM-SIGSAM Bulletin"},{"key":"BF02253296_CR5","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0898-1221(81)90060-2","volume":"7","author":"A. G. Akritas","year":"1981","unstructured":"Akritas, A. G.: Vincent's forgotten theorem, its extension and application. International Journal of Computers and Mathematics with Applications7, 309\u2013317 (1981).","journal-title":"International Journal of Computers and Mathematics with Applications"},{"key":"BF02253296_CR6","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1080\/00207168108803254","volume":"9","author":"A. G. Akritas","year":"1981","unstructured":"Akritas, A. G.: Exact algorithms for the implementation of Cauchy's rule. International Journal of Computer Mathematics9, 323\u2013333 (1981).","journal-title":"International Journal of Computer Mathematics"},{"key":"BF02253296_CR7","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":"BF02253296_CR8","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF02242791","volume":"24","author":"A. G. Akritas","year":"1980","unstructured":"Akritas, A. G., Danielopoulos, S. D.: On the complexity of algorithms for the translation of polynomials. Computing24, 51\u201360 (1980).","journal-title":"Computing"},{"key":"BF02253296_CR9","volume-title":"Theory of equations","author":"W. S. Burnside","year":"1886","unstructured":"Burnside, W. S., Panton, A. W.: Theory of equations, 2nd ed. Dublin-London: Dublin University Press Series 1886.","edition":"2nd ed"},{"key":"BF02253296_CR10","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/321662.321667","volume":"18","author":"L. E. Heindel","year":"1971","unstructured":"Heindel, L. E.: Integer arithmetic algorithms for polynomial real zero determination. Journal of the Association for Computing Machinery18, 533\u2013548 (1971).","journal-title":"Journal of the Association for Computing Machinery"},{"key":"BF02253296_CR11","unstructured":"Lagrange, J. L.: Trait\u00e9 de la R\u00e9solution des Equations Num\u00e9riques. Paris: 1778."},{"key":"BF02253296_CR12","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1307\/mmj\/1028999140","volume":"11","author":"K. Mahler","year":"1964","unstructured":"Mahler, K.: An inequality for the discriminant of a polynomial. Michigan Mathematical Journal11, 257\u2013262 (1964).","journal-title":"Michigan Mathematical Journal"},{"key":"BF02253296_CR13","series-title":"M. S. Research Report","volume-title":"Polynomial real root approximation using continued fractions","author":"K. H. Ng","year":"1980","unstructured":"Ng, K. H.: Polynomial real root approximation using continued fractions. M. S. Research Report, University of Kansas, Department of Computer Science, Lawrence, Kansas (1980)."},{"key":"BF02253296_CR14","volume-title":"Verteilung und Berechnung der Nullstellen reeller Polynome","author":"N. Obreschkoff","year":"1963","unstructured":"Obreschkoff, N.: Verteilung und Berechnung der Nullstellen reeller Polynome. Berlin: VEB Deutscher Verlag der Wissenschaften 1963."},{"key":"BF02253296_CR15","doi-asserted-by":"crossref","unstructured":"Petricle, S. R. (ed.): Proceedings of the second symposium on symbolic and algebraic manipulation. ACM (1971).","DOI":"10.1145\/800204"},{"key":"BF02253296_CR16","volume-title":"Theory of equations","author":"I. Todhunter","year":"1882","unstructured":"Todhunter, I.: Theory of equations. London: Macmillan 1882."},{"key":"BF02253296_CR17","volume-title":"Theory of equations","author":"J. V. Uspensky","year":"1948","unstructured":"Uspensky, J. V.: Theory of equations. New York: McGraw-Hill 1948."},{"issue":"No. 2","key":"BF02253296_CR18","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/1088301.1088304","volume":"9","author":"P. Verbaeten","year":"1975","unstructured":"Verbaeten, P.: Computing real zeros of polynomials with SAC-1. ACM-SIGSAM Bulletin9. No. 2, 8\u201310 (1975).","journal-title":"ACM-SIGSAM Bulletin"},{"key":"BF02253296_CR19","first-page":"351","volume":"1","author":"A. J. H. Vincent","year":"1836","unstructured":"Vincent, A. J. H.: Sur la R\u00e9solution des \u00c9quations Num\u00e9riques. Journal de Math\u00e9matiques Pures et Appliqu\u00e9es1, 351\u2013371 (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\/BF02253296.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02253296\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02253296","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T10:52:23Z","timestamp":1558003943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02253296"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,3]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,3]]}},"alternative-id":["BF02253296"],"URL":"https:\/\/doi.org\/10.1007\/bf02253296","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,3]]}}}