{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T09:27:26Z","timestamp":1772357246675,"version":"3.50.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2012,6,2]],"date-time":"2012-06-02T00:00:00Z","timestamp":1338595200000},"content-version":"vor","delay-in-days":7398,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1016\/s0747-7171(10)80005-7","type":"journal-article","created":{"date-parts":[[2010,6,4]],"date-time":"2010-06-04T04:35:34Z","timestamp":1275626134000},"page":"329-352","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":63,"title":["On the computational complexity and geometry of the first-order theory of the reals. Part III: Quantifier elimination"],"prefix":"10.1016","volume":"13","author":[{"given":"James","family":"Renegar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(10)80005-7_bib1","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0022-0000(86)90029-2","article-title":"The complexity of elementary algebra and geometry","volume":"32","author":"Ben-Or","year":"1986","journal-title":"J. Computer Syst. Sci."},{"key":"10.1016\/S0747-7171(10)80005-7_bib2","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1145\/321662.321665","article-title":"On Euclid's algorithm and the theory of subresultants","volume":"18","author":"Brown","year":"1971","journal-title":"J. Association for Computing Machinery"},{"key":"10.1016\/S0747-7171(10)80005-7_bib3","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/321371.321381","article-title":"Subresultants and reduced polynomial remainder sequences","volume":"14","author":"Collins","year":"1967","journal-title":"J. Association for Computing Machinery"},{"key":"10.1016\/S0747-7171(10)80005-7_bib4","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1137\/0205040","article-title":"Fast parallel matrix inversion algorithms","volume":"5","author":"Csanky","year":"1976","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0747-7171(10)80005-7_bib5","series-title":"A Decision Method for Elementary Algebra and Geometry","author":"Tarski","year":"1951"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717110800057?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717110800057?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:11:26Z","timestamp":1760058686000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717110800057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["S0747717110800057"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(10)80005-7","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1992,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the computational complexity and geometry of the first-order theory of the reals. Part III: Quantifier elimination","name":"articletitle","label":"Article Title"},{"value":"Journal of Symbolic Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0747-7171(10)80005-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1992 Academic Press Limited. Published by Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}