{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T10:12:52Z","timestamp":1648807972390},"reference-count":5,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4521,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1016\/s0304-3975(00)00007-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:51:54Z","timestamp":1027619514000},"page":"593-600","source":"Crossref","is-referenced-by-count":1,"title":["On weak and weighted computations over the real closure of Q"],"prefix":"10.1016","volume":"255","author":[{"given":"Felipe","family":"Cucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00007-4_BIB1","series-title":"Complexity and Real Computation","author":"Blum","year":"1998"},{"key":"10.1016\/S0304-3975(00)00007-4_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","article-title":"On a theory of computation and complexity over the real numbers","volume":"21","author":"Blum","year":"1989","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(00)00007-4_BIB3","doi-asserted-by":"crossref","unstructured":"P. Koiran, A weak version of the Blum, Shub & Smale model, J. Comput. System Sci. 54 (1997) 177\u2013189. A preliminary version appeared in 34th Annual IEEE Symp. on Foundations of Computer Science, 1993, pp. 486\u2013495.","DOI":"10.1006\/jcss.1997.1478"},{"key":"10.1016\/S0304-3975(00)00007-4_BIB4","series-title":"Computer Algebra, Symbolic and Algebraic Computation","first-page":"173","article-title":"Computing in algebraic extensions","author":"Loos","year":"1982"},{"key":"10.1016\/S0304-3975(00)00007-4_BIB5","unstructured":"G. Malajovich, On a transfer theorem for the P \u2260NP conjecture, J. Complexity, to appear. Available in dvi or postscript format at the URL address www.msri.org\/publications\/preprints\/online\/1998-069.html."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000074?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000074?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T16:59:47Z","timestamp":1555693187000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500000074"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":5,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0304397500000074"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00007-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}