{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:10:45Z","timestamp":1760141445934,"version":"build-2065373602"},"reference-count":4,"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)80004-5","type":"journal-article","created":{"date-parts":[[2010,6,4]],"date-time":"2010-06-04T04:35:34Z","timestamp":1275626134000},"page":"301-327","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":36,"title":["On the computational complexity and geometry of the first-order theory of the reals. Part II: The general decision problem. Preliminaries for 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)80004-5_bib1","first-page":"134","article-title":"Quantifier elimination for real closed fields by cylindrical algebraic decomposition","volume":"33","author":"Collins","year":"1975","journal-title":"Second GI Conference on Automata Theory and Formal Languages, Lecture Notes in Computer Science"},{"key":"10.1016\/S0747-7171(10)80004-5_bib2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0747-7171(88)80008-7","article-title":"Thorn's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets","volume":"5","author":"Coste","year":"1988","journal-title":"J. Symbolic Computation"},{"key":"10.1016\/S0747-7171(10)80004-5_bib3","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"},{"article-title":"Algorithmes rapides en s\u00e9quential et en parallele pour l'\u00e9limination de quantificateurs en g\u00e9om\u00e9trie \u00e9l\u00e9mentaire","year":"1987","author":"Fitchas","key":"10.1016\/S0747-7171(10)80004-5_bib4"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717110800045?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717110800045?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:25Z","timestamp":1760058685000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717110800045"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["S0747717110800045"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(10)80004-5","relation":{},"ISSN":["0747-7171"],"issn-type":[{"type":"print","value":"0747-7171"}],"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 II: The general decision problem. Preliminaries for 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)80004-5","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"}]}}