{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T23:59:01Z","timestamp":1649116741735},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540566861","type":"print"},{"value":"9783540476306","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56686-4_42","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:24:45Z","timestamp":1330255485000},"page":"170-179","source":"Crossref","is-referenced-by-count":1,"title":["Parallelization of quantifier elimination on a workstation network"],"prefix":"10.1007","author":[{"given":"Hoon","family":"Hong","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"14_CR1","unstructured":"D. S. Arnon. Algorithms for the geometry of semi-algebraic sets. Technical Report 436, Computer Sciences Dept, Univ. of Wisconsin-Madison, 1981. Ph.D. Thesis."},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1137\/0213054","volume":"13","author":"D. S. Arnon","year":"1984","unstructured":"D. S. Arnon, G. E. Collins, and S. McCallum. Cylindrical algebraic decomposition I: The basic algorithm. SIAM J. Comp., 13:865\u2013877, 1984.","journal-title":"SIAM J. Comp."},{"issue":"2","key":"14_CR3","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. H. Reif. The complexity of elementary algebra and geometry. J. Comput. System Sci., 32(2):251\u2013264, 1986.","journal-title":"J. Comput. System Sci."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"J. Canny. Some algebraic and geometric computations in PSPACE. In Proceedings of the 20th annual ACM symposium on the theory of computing, pages 460\u2013467, 1988.","DOI":"10.1145\/62212.62257"},{"key":"14_CR5","first-page":"134","volume-title":"Lecture Notes In Computer Science","author":"G. E. Collins","year":"1975","unstructured":"G. E. Collins. Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition. In Lecture Notes In Computer Science, pages 134\u2013183. Springer-Verlag, Berlin, 1975. Vol. 33."},{"issue":"3","key":"14_CR6","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0747-7171(08)80152-6","volume":"12","author":"G. E. Collins","year":"1991","unstructured":"G. E. Collins and H. Hong. Partial cylindrical algebraic decomposition for quantifier elimination. Journal of Symbolic Computation, 12(3):299\u2013328, September 1991.","journal-title":"Journal of Symbolic Computation"},{"key":"14_CR7","unstructured":"G. E. Collins and R. Loos. The SAC-2 Computer Algebra System. Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria A-4040."},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0022-4049(90)90159-F","volume":"67","author":"N. Fitchas","year":"1990","unstructured":"N. Fitchas, A. Galligo, and J. Morgenstern. Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields. Journal of Pure and Applied Algebra, (67):1\u201314, 1990.","journal-title":"Journal of Pure and Applied Algebra"},{"issue":"1","key":"14_CR9","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. Yu. Grigor'ev. The complexity of deciding Tarski algebra. Journal of Symbolic Computation, 5(1,2):65\u2013108, 1988.","journal-title":"Journal of Symbolic Computation"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"J. Heintz, M-F. Roy, and T. Recio. Algorithms in real algebraic geometry and applications to computational geometry. DIMACS, 6, 1991.","DOI":"10.1090\/dimacs\/006\/08"},{"key":"14_CR11","unstructured":"J. Heintz, M-F. Roy, and P. Solern\u00f3. On the complexity of semialgebraic sets. In Proc. IFIP, pages 293\u2013298, 1989."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"J. Heintz, M-F. Roy, and P. Solern\u00f3. Single exponential path finding in semi-algebraic sets I: The case of smooth compact hypersurface. In Proceedings of AAECC-8, 1990.","DOI":"10.1007\/3-540-54195-0_50"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"J. Heintz, M-F. Roy, and P. Solern\u00f3. Single exponential path finding in semi-algebraic sets II: The general case. In Abhyankar's conference proceedings, 1990.","DOI":"10.1007\/3-540-54195-0_50"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"H. Hong. An improvement of the projection operator in cylindrical algebraic decomposition. In International Symposium of Symbolic and Algebraic Computation ISSAC-90, pages 261\u2013264, 1990.","DOI":"10.1145\/96877.96943"},{"key":"14_CR15","unstructured":"H. Hong. Improvements in CAD-based Quantifier Elimination. PhD thesis, The Ohio State University, 1990."},{"key":"14_CR16","volume-title":"Technical Report 91-41.0","author":"H. Hong","year":"1991","unstructured":"H. Hong. Comparison of several decision algorithms for the existential theory of the reals. Technical Report 91-41.0, Research Institute for Symbolic Computation, Johannes Kepler University A-4040 Linz, Austria, 1991."},{"key":"14_CR17","volume-title":"Technical Report 91-55.0","author":"H. Hong","year":"1991","unstructured":"H. Hong. Parallelization of quantifier elimination on workstation network. Technical Report 91-55.0, Research Institute for Symbolic Computation, Johannes Kepler University A-4040 Linz, Austria, 1991."},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"H. Hong. Simple solution formula construction in cylindrical algebraic decomposition based quantifier elimination. In International Conference on Symbolic and Algebraic Computation ISSAC-92, pages 177\u2013188, 1992.","DOI":"10.1145\/143242.143306"},{"key":"14_CR19","unstructured":"L. Langemyr. The cylindrical algebraic decomposition algorithm and multiple algebraic extensions. In Proc. 9th IMA Conference on the Mathematics of Surfaces, September 1990."},{"issue":"1","key":"14_CR20","first-page":"15","volume":"10","author":"R. G. K. Loos","year":"1976","unstructured":"R. G. K. Loos. The algorithm description language ALDES (Report). ACM SIG-SAM Bull., 10(1):15\u201339, 1976.","journal-title":"ACM SIG-SAM Bull."},{"key":"14_CR21","unstructured":"S. McCallum. An Improved Projection Operator for Cylindrical Algebraic Decomposition. PhD thesis, University of Wisconsin-Madison, 1984."},{"issue":"3","key":"14_CR22","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0747-7171(10)80005-7","volume":"13","author":"J. Renegar","year":"1992","unstructured":"J. Renegar. On the computational complexity and geometry of the first-order theory of the reals (part III). Journal of Symbolic Computation, 13(3):329\u2013352, 1992.","journal-title":"Journal of Symbolic Computation"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"B. D. Saunders, H. R. Lee, and S. K. Abdali. A parallel implementation of the cylindrical algebraic decomposition algorithm. In International Symposium of Symbolic and Algebraic Computation, pages 298\u2013307, 1990.","DOI":"10.1145\/74540.74576"},{"key":"14_CR24","doi-asserted-by":"crossref","DOI":"10.1525\/9780520348097","volume-title":"A Decision Method for Elementary Algebra and Geometry","author":"A. Tarski","year":"1951","unstructured":"A. Tarski. A Decision Method for Elementary Algebra and Geometry. Univ. of California Press, Berkeley, second edition, 1951.","edition":"second edition"}],"container-title":["Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56686-4_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T04:54:25Z","timestamp":1640926465000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56686-4_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540566861","9783540476306"],"references-count":24,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-56686-4_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"published":{"date-parts":[[1993]]}}}