{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:23Z","timestamp":1725663743111},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540545224"},{"type":"electronic","value":"9783540384366"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54522-0_100","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:57:41Z","timestamp":1330210661000},"page":"108-117","source":"Crossref","is-referenced-by-count":4,"title":["An improved sign determination algorithm"],"prefix":"10.1007","author":[{"given":"J. F.","family":"Canny","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0022-0000(86)90029-2","volume":"32","author":"M. Ben-Or","year":"1986","unstructured":"M. Ben-Or, D. Kozen, and J. Reif. The complexity of elementary algebra and geometry. J. Comp. and Sys. Sci., 32:251\u2013264, 1986.","journal-title":"J. Comp. and Sys. Sci."},{"doi-asserted-by":"crossref","unstructured":"J. Canny. Some algebraic and geometric computations in PSPACE. In ACM Symposium on Theory of Computing, pages 460\u2013467, 1988.","key":"10_CR2","DOI":"10.1145\/62212.62257"},{"doi-asserted-by":"crossref","unstructured":"J. Canny. Computing roadmaps of general semi-algebraic sets. In AAECC-91 (this volume), 1991.","key":"10_CR3","DOI":"10.1007\/3-540-54522-0_99"},{"doi-asserted-by":"crossref","unstructured":"J.F. Canny, D.Y. Grigor'ev, and N.N. Vorobjov. Finding connected components of a semialgebraic set in subexponential time. App. Algebra in Eng. Comm. and Comp. (submitted), 1991.","key":"10_CR4","DOI":"10.1007\/BF01614146"},{"key":"10_CR5","first-page":"135","volume":"33","author":"G. Collins","year":"1975","unstructured":"G. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. Springer LNCS, 33:135\u2013183, 1975.","journal-title":"Springer LNCS"},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0747-7171(88)80006-3","volume":"5","author":"D.Y. Grigor'ev","year":"1988","unstructured":"D.Y. Grigor'ev. Complexity of deciding Tarski algebra. Journal of Symbolic Computation, 5:65\u2013108, 1988.","journal-title":"Journal of Symbolic Computation"},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0747-7171(88)80005-1","volume":"5","author":"D.Y. Grigor'ev","year":"1988","unstructured":"D.Y. Grigor'ev and N.N. Vorobjov. Solving systems of polynomial equations in subexponential time. Journal of Symbolic Computation, 5:37\u201364, 1988.","journal-title":"Journal of Symbolic Computation"},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"101","DOI":"10.24033\/bsmf.2138","volume":"118","author":"J. Heintz","year":"1990","unstructured":"J. Heintz, M.F. Roy, and P. Solerno. Complexit\u00e9 du principe de Tarski-Seidenberg. Bull. Soc. Math. France, 118:101\u2013126, 1990.","journal-title":"Bull. Soc. Math. France"},{"doi-asserted-by":"crossref","unstructured":"C.A. Neff. Specified precision polynomial root isolation is in NC. In IEEE Conference on Foundations of Computer Science, 1990.","key":"10_CR9","DOI":"10.1109\/FSCS.1990.89534"},{"unstructured":"J. Renegar. On the computational complexity and geometry of the first-order theory of the reals, parts I, II and III. Technical Report 852,855,856, Cornell University, Operations Research Dept., 1989.","key":"10_CR10"},{"issue":"1","key":"10_CR11","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0747-7171(08)80035-1","volume":"10","author":"M.F. Roy","year":"1990","unstructured":"M.F. Roy and A. Szpirglas. Complexity of computation on real algebraic numbers. Journal of Symbolic Computation, 10(1):39\u201352, 1990.","journal-title":"Journal of Symbolic Computation"},{"key":"10_CR12","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1090\/S0002-9947-1974-0349648-2","volume":"197","author":"A. Seidenberg","year":"1974","unstructured":"A. Seidenberg. Constructions in algebra. Trans. AMS, 197:273\u2013313, 1974.","journal-title":"Trans. AMS"},{"key":"10_CR13","volume-title":"A Decision Method for Elementary Algebra and Geometry","author":"A. Tarski","year":"1948","unstructured":"A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, Berkeley, 1948."}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54522-0_100.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:55:21Z","timestamp":1605646521000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54522-0_100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540545224","9783540384366"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-54522-0_100","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}