{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:32:01Z","timestamp":1759847521056},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1984,2,1]],"date-time":"1984-02-01T00:00:00Z","timestamp":444441600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1984,2]]},"DOI":"10.1007\/bf02612355","type":"journal-article","created":{"date-parts":[[2007,4,27]],"date-time":"2007-04-27T02:54:07Z","timestamp":1177642447000},"page":"156-163","source":"Crossref","is-referenced-by-count":11,"title":["On the cost of computing roots of polynomials"],"prefix":"10.1007","volume":"28","author":[{"given":"Harold W.","family":"Kuhn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeke","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Senlin","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02612355_CR1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF01582093","volume":"16","author":"M. Kojima","year":"1979","unstructured":"M. Kojima, H. Nishino and N. Arima, \u201cA PL homotopy for finding all the roots of a polynomial\u201d,Mathematical Programming 16 (1979) 37\u201362.","journal-title":"Mathematical Programming"},{"key":"BF02612355_CR2","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/BFb0121246","volume":"1","author":"H. Kuhn","year":"1974","unstructured":"H. Kuhn, \u201cA new proof of the fundamental theorem of algebra\u201d,Mathematical Programming Study 1 (1974) 148\u2013158.","journal-title":"Mathematical Programming Study"},{"key":"BF02612355_CR3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/B978-0-12-398050-2.50007-4","volume-title":"Fixed points: Algorithms and applications","author":"H. Kuhn","year":"1977","unstructured":"H. Kuhn, \u201cFinding roots of polynomials by pivoting\u201d, in: S. Karamardian, ed.,Fixed points: Algorithms and applications (Academic Press, New York, 1977), pp. 11\u201340."},{"key":"BF02612355_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-1981-14858-8","volume":"4","author":"S. Smale","year":"1981","unstructured":"S. Smale, \u201cThe fundamental theorem of algebra and complexity theory,Bulletin of the American Mathematical Society 4 (1981) 1\u201336.","journal-title":"Bulletin of the American Mathematical Society"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02612355.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02612355\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02612355","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T04:34:25Z","timestamp":1558326865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02612355"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,2]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,2]]}},"alternative-id":["BF02612355"],"URL":"https:\/\/doi.org\/10.1007\/bf02612355","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,2]]}}}