{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:54:25Z","timestamp":1743126865460,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354666"},{"type":"electronic","value":"9783540354680"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11780342_45","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T02:19:46Z","timestamp":1151461186000},"page":"435-444","source":"Crossref","is-referenced-by-count":1,"title":["A Subrecursive Refinement of the Fundamental Theorem of Algebra"],"prefix":"10.1007","author":[{"given":"Peter","family":"Peshev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimiter","family":"Skordev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Grzegorczyk, A.: Some Classes of Recursive Functions, Dissertationes Math. (Rozprawy Mat.), vol.\u00a04, Warsaw (1953)","key":"45_CR1"},{"key":"45_CR2","doi-asserted-by":"crossref","first-page":"168","DOI":"10.4064\/fm-42-1-168-202","volume":"42","author":"A. Grzegorczyk","year":"1955","unstructured":"Grzegorczyk, A.: Computable functionals. Fund. Math.\u00a042, 168\u2013202 (1955)","journal-title":"Fund. Math."},{"doi-asserted-by":"crossref","unstructured":"Peshev, P.: A subrecursive refinement of the fundamental theorem of algebra. Sofia University, Sofia (master thesis, in Bulgarian) (2005)","key":"45_CR3","DOI":"10.1007\/11780342_45"},{"issue":"10","key":"45_CR4","doi-asserted-by":"publisher","first-page":"562","DOI":"10.2307\/2306105","volume":"52","author":"P.C. Rosenbloom","year":"1945","unstructured":"Rosenbloom, P.C.: An elementary constructive proof of the fundamental theorem of algebra. The Amer. Math. Monthly\u00a052(10), 562\u2013570 (1945)","journal-title":"The Amer. Math. Monthly"},{"issue":"suppl.\u00a01","key":"45_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1002\/1521-3870(200210)48:1+<91::AID-MALQ91>3.0.CO;2-L","volume":"48","author":"D. Skordev","year":"2002","unstructured":"Skordev, D.: Computability of real numbers by using a given class of functions in the set of the natural numbers. Math. Logic Quarterly\u00a048(suppl.\u00a01), 91\u2013106 (2002)","journal-title":"Math. Logic Quarterly"},{"key":"45_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9_1","volume-title":"An Introduction","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. In: An Introduction. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Logical Approaches to Computational Barriers"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780342_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T13:00:33Z","timestamp":1555678833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780342_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354666","9783540354680"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11780342_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}