{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T19:00:09Z","timestamp":1730314809626,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,7,28]]},"DOI":"10.1145\/1576702.1576718","type":"proceedings-article","created":{"date-parts":[[2009,7,28]],"date-time":"2009-07-28T12:45:28Z","timestamp":1248785128000},"page":"95-102","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":57,"title":["Computing cylindrical algebraic decomposition via triangular decomposition"],"prefix":"10.1145","author":[{"given":"Changbo","family":"Chen","sequence":"first","affiliation":[{"name":"University of Western Ontario, London, Canada"}]},{"given":"Marc Moreno","family":"Maza","sequence":"additional","affiliation":[{"name":"University of Western Ontario, London, Canada"}]},{"given":"Bican","family":"Xia","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"given":"Lu","family":"Yang","sequence":"additional","affiliation":[{"name":"East China Normal University, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2009,7,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/0213054"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1999.0269"},{"key":"e_1_3_2_1_3_1","series-title":"Algorithms and Computations in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-33099-2","volume-title":"Algorithms in real algebraic geometry","author":"Basu S.","year":"2006","unstructured":"S. Basu , R. Pollack , and M. F. Roy . Algorithms in real algebraic geometry , volume 10 of Algorithms and Computations in Mathematics . Springer-Verlag , 2006 . S. Basu, R. Pollack, and M. F. Roy. Algorithms in real algebraic geometry, volume 10 of Algorithms and Computations in Mathematics. Springer-Verlag, 2006."},{"volume-title":"Proc. of Transgressive Computing 2006","year":"2006","author":"Boulier F.","key":"e_1_3_2_1_4_1","unstructured":"F. Boulier , F. Lemaire , and M. Moreno Maza . Well known theorems on triangular systems and the D5 principle . In Proc. of Transgressive Computing 2006 , Granada, Spain , 2006 . F. Boulier, F. Lemaire, and M. Moreno Maza. Well known theorems on triangular systems and the D5 principle. In Proc. of Transgressive Computing 2006, Granada, Spain, 2006."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2001.0463"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2000.0394"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277548.1277557"},{"volume-title":"Quantifier Elimination and Cylindical Algebraic Decomposition, Texts and Mongraphs in Symbolic Computation","year":"1998","author":"Caviness B.","key":"e_1_3_2_1_8_1","unstructured":"B. Caviness and J. Johnson , editors . Quantifier Elimination and Cylindical Algebraic Decomposition, Texts and Mongraphs in Symbolic Computation . Springer , 1998 . B. Caviness and J. Johnson, editors. Quantifier Elimination and Cylindical Algebraic Decomposition, Texts and Mongraphs in Symbolic Computation. Springer, 1998."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"C.\n Chen O.\n Golubitsky F.\n Lemaire M.\n Moreno Maza and \n W.\n Pan\n . \n Comprehensive Triangular Decomposition volume \n 4770\n of \n LNCS pages \n 73\n --\n 101\n . \n Springer 2007\n . C. Chen O. Golubitsky F. Lemaire M. Moreno Maza and W. Pan. Comprehensive Triangular Decomposition volume 4770 of LNCS pages 73--101. Springer 2007.","DOI":"10.1007\/978-3-540-75187-8_7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277548.1277562"},{"key":"e_1_3_2_1_11_1","first-page":"515","article-title":"Quantifier elimination for real closed fields by cylindrical algebraic decomposition","volume":"33","author":"Collins G. E.","year":"1975","unstructured":"G. E. Collins . Quantifier elimination for real closed fields by cylindrical algebraic decomposition . Springer Lecture Notes in Computer Science , 33 : 515 -- 532 , 1975 . G. E. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. Springer Lecture Notes in Computer Science, 33:515--532, 1975.","journal-title":"Springer Lecture Notes in Computer Science"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80152-6"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2002.0547"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073884.1073901"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005285.1005303"},{"key":"e_1_3_2_1_16_1","first-page":"221","volume-title":"Algorithmic Algebra and Number Theory","author":"Dolzmann A.","year":"1998","unstructured":"A. Dolzmann , T. Sturm , and V. Weispfenning . Real quantifier elimination in practice . In Algorithmic Algebra and Number Theory , pages 221 -- 247 , 1998 . A. Dolzmann, T. Sturm, and V. Weispfenning. Real quantifier elimination in practice. In Algorithmic Algebra and Number Theory, pages 221--247, 1998."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/96877.96943"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/143242.143306"},{"key":"e_1_3_2_1_19_1","series-title":"LNCS","first-page":"1","volume-title":"Symbolic and numerical scientific computation (Hagenberg","year":"2001","unstructured":"É. Hubert. Notes on triangular sets and triangulation-decomposition algorithms. I. Polynomial systems . In Symbolic and numerical scientific computation (Hagenberg , 2001 ), volume 2630 of LNCS , pages 1 -- 39 . Springer , 2003. É. Hubert. Notes on triangular sets and triangulation-decomposition algorithms. I. Polynomial systems. In Symbolic and numerical scientific computation (Hagenberg, 2001), volume 2630 of LNCS, pages 1--39. Springer, 2003."},{"key":"e_1_3_2_1_20_1","first-page":"355","volume-title":"Maple Conference 2005","author":"Lemaire F.","year":"2005","unstructured":"F. Lemaire , M. Moreno Maza , and Y. Xie . The RegularChains library. In Ilias S. Kotsireas, editor , Maple Conference 2005 , pages 355 -- 368 , 2005 . F. Lemaire, M. Moreno Maza, and Y. Xie. The RegularChains library. In Ilias S. Kotsireas, editor, Maple Conference 2005, pages 355--368, 2005."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1576702.1576736"},{"volume-title":"Proc. MICA'08","year":"2008","author":"Li X.","key":"e_1_3_2_1_22_1","unstructured":"X. Li , M. Moreno Maza , R. Rasheed , and É. Schost. The Modpn library: Bringing fast polynomial arithmetic into Maple . In Proc. MICA'08 , 2008 . X. Li, M. Moreno Maza, R. Rasheed, and É. Schost. The Modpn library: Bringing fast polynomial arithmetic into Maple. In Proc. MICA'08, 2008."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277548.1277585"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(88)80010-5"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/36.5.432"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1999.0327"},{"volume-title":"Elimination Methods","year":"2000","author":"Wang D. M.","key":"e_1_3_2_1_28_1","unstructured":"D. M. Wang . Elimination Methods . Springer , New York , 2000 . D. M. Wang. Elimination Methods. Springer, New York, 2000."},{"key":"e_1_3_2_1_29_1","first-page":"2","article-title":"A zero structure theorem for polynomial equations solving","volume":"1","author":"Wu W. T.","year":"1987","unstructured":"W. T. Wu . A zero structure theorem for polynomial equations solving . MM Research Preprints , 1 : 2 -- 12 , 1987 . W. T. Wu. A zero structure theorem for polynomial equations solving. MM Research Preprints, 1:2--12, 1987.","journal-title":"MM Research Preprints"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2002.0572"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2006.06.003"},{"issue":"6","key":"e_1_3_2_1_32_1","first-page":"33","article-title":"A complete algorithm for automated discovering of a class of inequality--type theorems","volume":"44","author":"Yang L.","year":"2001","unstructured":"L. Yang , X. Hou , and B. Xia . A complete algorithm for automated discovering of a class of inequality--type theorems . Science in China, Series F , 44 ( 6 ): 33 -- 49 , 2001 . L. Yang, X. Hou, and B. Xia. A complete algorithm for automated discovering of a class of inequality--type theorems. Science in China, Series F, 44(6):33--49, 2001.","journal-title":"Science in China, Series F"}],"event":{"name":"ISSAC '09: International Symposium on Symbolic and Algebraic Computation","sponsor":["ACM Association for Computing Machinery","SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Seoul Republic of Korea","acronym":"ISSAC '09"},"container-title":["Proceedings of the 2009 international symposium on Symbolic and algebraic computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1576702.1576718","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T19:38:39Z","timestamp":1673465919000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1576702.1576718"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,28]]},"references-count":31,"alternative-id":["10.1145\/1576702.1576718","10.1145\/1576702"],"URL":"https:\/\/doi.org\/10.1145\/1576702.1576718","relation":{},"subject":[],"published":{"date-parts":[[2009,7,28]]},"assertion":[{"value":"2009-07-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}