{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:58:11Z","timestamp":1776333491949,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540074076","type":"print"},{"value":"9783540379232","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1975]]},"DOI":"10.1007\/3-540-07407-4_17","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T10:56:52Z","timestamp":1330167412000},"page":"134-183","source":"Crossref","is-referenced-by-count":563,"title":["Quantifier elimination for real closed fields by cylindrical algebraic decompostion"],"prefix":"10.1007","author":[{"given":"George E.","family":"Collins","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"issue":"4","key":"17_CR1","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1145\/321662.321664","volume":"18","author":"W. S. Brown","year":"1971","unstructured":"Brown, W.S., On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors, J. ACM, vol. 18, no. 4 (Oct. 1971) pp. 478\u2013504.","journal-title":"J. ACM"},{"issue":"4","key":"17_CR2","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1145\/321662.321665","volume":"18","author":"W. S. Brown","year":"1971","unstructured":"Brown, W.S., and Traub, J.F., On Euclid's Algorithm and the Theory of Subresultants, J. ACM, vol. 18, no. 4 (Oct. 1971), pp. 505\u2013514.","journal-title":"J. ACM"},{"issue":"2","key":"17_CR3","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/cpa.3160220202","volume":"XXII","author":"P. J. Cohen","year":"1969","unstructured":"Cohen, P.J., Decision Procedures for Real and p-adic Fields, Comm. Pure and Applied Math., vol. XXII, no. 2 (March 1969), pp. 131\u2013151.","journal-title":"Comm. Pure and Applied Math."},{"issue":"1","key":"17_CR4","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/321371.321381","volume":"14","author":"G. E. Collins","year":"1967","unstructured":"Collins, G.E., Subresultants and Reduced Polynomial Remainder Sequences, J. ACM, vol. 14, no. 1, (Jan. 1967), pp. 128\u2013142.","journal-title":"J. ACM"},{"issue":"4","key":"17_CR5","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1145\/321662.321666","volume":"18","author":"G. E. Collins","year":"1971","unstructured":"Collins, G.E., The Calculation of Multivariate Polynomial Resultants, J. ACM, vol. 18, no. 4 (Oct. 1971), pp. 515\u2013532.","journal-title":"J. ACM"},{"issue":"7","key":"17_CR6","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1080\/00029890.1973.11993365","volume":"80","author":"G. E. Collins","year":"1973","unstructured":"Collins, G.E., Computer Algebra of Polynomials and Rational Functions, Am. Math. Monthly, vol. 80, no. 7 (Aug.-Sept. 1973), pp. 725\u2013755.","journal-title":"Am. Math. Monthly"},{"key":"17_CR7","unstructured":"Collins, G.E., Efficient Quantifier Elimination for Elementary Algebra (abstract), Symposium on Complexity of Sequential and Parallel Numerical Algorithms, Carnegie-Mellon University, May 1973."},{"issue":"3","key":"17_CR8","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1145\/1086837.1086852","volume":"8","author":"G. E. Collins","year":"1974","unstructured":"Collins, G.E., Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition \u2014 Preliminary Report, Proceedings of EUROSAM 74, STGSAM Bulletin, Vol. 8, no. 3 (August 1974), pp. 80\u201390.","journal-title":"STGSAM Bulletin"},{"key":"17_CR9","unstructured":"Fischer, M.J., and Rabin, M.O., Super-Exponential Complexity of Presburger Arithmetic, M.I.T. MAC Tech. Memo. 43, Feb. 1974."},{"key":"17_CR10","unstructured":"Goldhaber, J.K., and Ehrlich, G., Algebra, MacMillan Co., 1970."},{"issue":"4","key":"17_CR11","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/321662.321667","volume":"18","author":"L. E. Heindel","year":"1971","unstructured":"Heindel, L.E., Integer Arithmetic Algorithms for Polynomial Real Zero Determination, J. ACM, vo. 18, no. 4 (Oct. 1971), pp. 533\u2013548.","journal-title":"J. ACM"},{"key":"17_CR12","unstructured":"Loos, R., G.K., A Constructive Approach to Algebraic Numbers, SIAM Journal on Computing, to appear."},{"key":"17_CR13","unstructured":"Marden, M., The Geometry of the Zeros of a Polynomial in a Complex Variable, Am. Math. Soc., Providence, 1949."},{"key":"17_CR14","unstructured":"Musser, D.R., Algorithms for Polynomial Factorization (Ph.D. Thesis), Univ. of Wisconsin Computer Sciences Dept. Tech. Report No. 134, Sept. 1971."},{"issue":"2","key":"17_CR15","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1145\/321879.321890","volume":"22","author":"D. R. Musser","year":"1975","unstructured":"Musser, D.R., Multivariate Polynomial Factorization, J.ACM., Vol. 22, No. 2 (April 1975), pp. 291\u2013308.","journal-title":"J.ACM."},{"key":"17_CR16","unstructured":"Rubald, C.M., Algorithms for Polynomials over a Real Algebraic Number Field (Ph.D. Thesis), Computer Sciences Dept. Tech. Report No. 206, Jan. 1974."},{"issue":"2","key":"17_CR17","doi-asserted-by":"crossref","first-page":"365","DOI":"10.2307\/1969640","volume":"60","author":"A. Seidenberg","year":"1954","unstructured":"Seidenberg, A., A New Decision Method for Elementary Algebra, Annals of Math., vol. 60, no. 2 (Sept. 1954), pp. 365\u2013374.","journal-title":"Annals of Math."},{"key":"17_CR18","doi-asserted-by":"crossref","DOI":"10.1525\/9780520348097","volume-title":"A Decision Method for Elementary Algebra and Geometry","author":"A. Tarski","year":"1951","unstructured":"Tarski, A., A Decision Method for Elementary Algebra and Geometry, second ed., rev., Univ. of California Press, Berkeley, 1951.","edition":"second ed."},{"key":"17_CR19","unstructured":"van der Waerden, B.L., Modern Algebra, vol. I, F. Ungar Co., New York, 1953."},{"key":"17_CR20","unstructured":"B\u00f6ge, W., private communication, June 1973"},{"key":"17_CR21","unstructured":"Holthusen, C., Vereinfachungen f\u00fcr Tarski's Entscheidungsverfahren der Elementaren Reelen Algebra (Diplomarbeit, University of Heidelberg), January 1974."},{"issue":"126","key":"17_CR22","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1090\/S0025-5718-1974-0345940-X","volume":"28","author":"G. E. Collins","year":"1974","unstructured":"Collins, G.E., and E. Horowitz, The Minimum Root Separation of a Polynomial, Math. of Comp., Vol. 28, No. 126, (April 1974), pp. 589\u2013597.","journal-title":"Math. of Comp."},{"issue":"128","key":"17_CR23","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1090\/S0025-5718-1974-0354624-3","volume":"28","author":"M. Mignotte","year":"1974","unstructured":"Mignotte, M., An Inequality About Factors of Polynomials, Math. of Comp., Vol. 28, No. 128 (October 1974), pp. 1153\u20131157.","journal-title":"Math. of Comp."},{"key":"17_CR24","volume-title":"The Art of Computer Programming, Vol. 2: Seminumerical Algorithms","author":"D. E. Knuth","year":"1969","unstructured":"Knuth, D.E., The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, Addison-Wesley, Reading, 1969."},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Sch\u00f6nhage, A., and V. Strassen, Schnelle Multiplikation gro\u00dfer Zahlen, Computing, Vol. 7, pp. 281\u2013292.","DOI":"10.1007\/BF02242355"},{"issue":"1","key":"17_CR26","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1137\/0204006","volume":"4","author":"J. Ferrante","year":"1975","unstructured":"Ferrante, J., and C. Rackoff, A Decision Procedure for the First Order Theory of Real Addition with Order, SIAM Journal on Computing, Vol. 4, No. 1 (March 1975), pp. 69\u201376.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern, May 20\u201323, 1975"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-07407-4_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T19:39:23Z","timestamp":1640893163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-07407-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975]]},"ISBN":["9783540074076","9783540379232"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-07407-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1975]]}}}