{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:23:24Z","timestamp":1725798204541},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662441985"},{"type":"electronic","value":"9783662441992"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44199-2_66","type":"book-chapter","created":{"date-parts":[[2014,7,31]],"date-time":"2014-07-31T18:17:11Z","timestamp":1406830631000},"page":"434-441","source":"Crossref","is-referenced-by-count":0,"title":["Hierarchical Comprehensive Triangular Decomposition"],"prefix":"10.1007","author":[{"given":"Zhenghong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Xiaoxian","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Bican","family":"Xia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"66_CR1","doi-asserted-by":"crossref","unstructured":"Alvandi, P., Chen, C., Moreno Maza, M.: Computing the limit points of the quasi-component of a regular chain in dimension one. Computer Algebra in Scientific Computing, 30\u201345 (2013)","DOI":"10.1007\/978-3-319-02297-0_3"},{"key":"66_CR2","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1006\/jsco.1999.0269","volume":"28","author":"P. Aubry","year":"1999","unstructured":"Aubry, P., Lazard, D., Moreno Maza, M.: On the theories of triangular sets. J. Symb. Comp.\u00a028, 105\u2013124 (1999)","journal-title":"J. Symb. Comp."},{"key":"66_CR3","doi-asserted-by":"crossref","unstructured":"Chen, C., Davenport, J., May, J.P., Moreno Maza, M., Xia, B., Xiao, R.: Triangular decomposition of semi-algebraic systems. In: Proc. ISSAC, pp. 187\u2013194 (2010)","DOI":"10.1145\/1837934.1837972"},{"key":"66_CR4","doi-asserted-by":"crossref","unstructured":"Chen, C., Davenport, J., Moreno Maza, M., Xia, B., Xiao, R.: Computing with semi-algebraic sets represented by triangular decomposition. In: Proc. ISSAC, pp. 75\u201382 (2011)","DOI":"10.1145\/1993886.1993903"},{"key":"66_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-540-75187-8_7","volume-title":"Computer Algebra in Scientific Computing","author":"C. Chen","year":"2007","unstructured":"Chen, C., Golubitsky, O., Lemaire, F., Maza, M.M., Pan, W.: Comprehensive triangular decomposition. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2007. LNCS, vol.\u00a04770, pp. 73\u2013101. Springer, Heidelberg (2007)"},{"issue":"6","key":"66_CR6","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1016\/j.jsc.2011.12.023","volume":"47","author":"C. Chen","year":"2012","unstructured":"Chen, C., Moreno Maza, M.: Algorithms for computing triangular decomposition of polynomial systems. J. Symb. Comp.\u00a047 (6), 610\u2013642 (2012)","journal-title":"J. Symb. Comp."},{"key":"66_CR7","doi-asserted-by":"crossref","unstructured":"Chou, S.-C.: Mechanical geometry theorem proving. Springer (1988)","DOI":"10.1007\/978-94-009-4037-6"},{"key":"66_CR8","unstructured":"Chen, Z., Tang, X., Xia, B.: Generic regular decompositions for parametric polynomial systems. Accepted by Journal of Systems Science and Complexity (2013), arXiv:1301.3991v1"},{"key":"66_CR9","doi-asserted-by":"crossref","unstructured":"Gao, X.-S., Chou, S.-C.: Solving parametric algebraic systems. In: Proc. ISSAC, pp. 335\u2013341 (1992)","DOI":"10.1145\/143242.143348"},{"issue":"8","key":"66_CR10","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1109\/TPAMI.2003.1217599","volume":"25","author":"X.-S. Gao","year":"2003","unstructured":"Gao, X.-S., Hou, X., Tang, J., Chen, H.: Complete solution classification for the perspective-three-point problem. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a025(8), 930\u2013943 (2003)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"66_CR11","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/jsco.1993.1011","volume":"15","author":"M. Kalkbrener","year":"1993","unstructured":"Kalkbrener, M.: A generalized euclidean algorithm for computing for computing triangular representationa of algebraic varieties. J. Symb. Comp.\u00a015, 143\u2013167 (1993)","journal-title":"J. Symb. Comp."},{"key":"66_CR12","doi-asserted-by":"crossref","unstructured":"Kapur, D., Sun, Y., Wang, D.: A new algorithm for computing comprehensive gr\u00f6bner systems. In: Proc. ISSAC, pp. 25\u201328 (2010)","DOI":"10.1145\/1837934.1837946"},{"key":"66_CR13","unstructured":"Moreno Maza, M.: On triangular decompositions of algebraic varieties. Technical Report TR 4\/99, NAG Ltd., Oxford, UK (1999)"},{"key":"66_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-77356-6_8","volume-title":"Automated Deduction in Geometry","author":"A. Montes","year":"2007","unstructured":"Montes, A., Recio, T.: Automatic discovery of geometry theorems using minimal canonical comprehensive Gr\u00f6bner systems. In: Botana, F., Recio, T. (eds.) ADG 2006. LNCS (LNAI), vol.\u00a04869, pp. 113\u2013138. Springer, Heidelberg (2007)"},{"key":"66_CR15","doi-asserted-by":"crossref","unstructured":"Nabeshima, K.: A speed-up of the algorithm for computing comprehensive gr\u00f6bner systems. In: Proc. ISSAC, pp. 299\u2013306 (2007)","DOI":"10.1145\/1277548.1277589"},{"key":"66_CR16","doi-asserted-by":"crossref","unstructured":"Suzuki, A., Sato, Y.: An alternative approach to comprehensive gr\u00f6bner bases. In: Proc. ISSAC, pp. 255\u2013261 (2002)","DOI":"10.1145\/780506.780539"},{"key":"66_CR17","doi-asserted-by":"crossref","unstructured":"Suzuki, A., Sato, Y.: A simple algorithm to compute comprehensive gr\u00f6bner bases. In: Proc. ISSAC, pp. 326\u2013331 (2006)","DOI":"10.1145\/1145768.1145821"},{"key":"66_CR18","doi-asserted-by":"crossref","unstructured":"Tang, X., Chen, Z., Xia, B.: Generic regular decompositions for generic zero-dimensional systems. Accepted by Science China: Information Sciences (2012), doi: 10.1007\/s11432-013-5057-5","DOI":"10.1007\/s11432-013-5057-5"},{"key":"66_CR19","doi-asserted-by":"crossref","unstructured":"Wang, D.K.: Zero decomposition algorithms for system of polynomial equations. In: Computer Mathematics, pp. 67\u201370. World Scientific (2000)","DOI":"10.1142\/9789812791962_0009"},{"key":"66_CR20","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1006\/jsco.1999.0355","volume":"30","author":"D.M. Wang","year":"2000","unstructured":"Wang, D.M.: Computing triangular systems and regular systems. J. Symb. Comp.\u00a030, 221\u2013236 (2000)","journal-title":"J. Symb. Comp."},{"key":"66_CR21","doi-asserted-by":"crossref","unstructured":"Wang, D.M.: Elimination methods. Springer (2001)","DOI":"10.1007\/978-3-7091-6202-6"},{"key":"66_CR22","doi-asserted-by":"crossref","unstructured":"Wang, D.M.: Elimination practice: software yools and applications. Imperial College Press (2004)","DOI":"10.1142\/9781848161207"},{"key":"66_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0747-7171(92)90023-W","volume":"14","author":"V. Weispfenning","year":"1992","unstructured":"Weispfenning, V.: Comprehensive gr\u00f6bner bases. J. Symb. Comp.\u00a014, 1\u201329 (1992)","journal-title":"J. Symb. Comp."},{"key":"66_CR24","unstructured":"Wu, W.-T.: Basic principles of mechanical theorem proving in elementary geometries. Science in China Series A Mathematics, 507\u2013516 (1977) (in Chinese)"},{"issue":"1","key":"66_CR25","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02713938","volume":"44","author":"L. Yang","year":"2001","unstructured":"Yang, L., Hou, X., Xia, B.: A complete algorithm for automated discovering of a class of inequality-type theorems. Science in China Series F Information Sciences\u00a044(1), 33\u201349 (2001)","journal-title":"Science in China Series F Information Sciences"},{"key":"66_CR26","unstructured":"Yang, L., Xia, B.: Automatic inequality proving and discovering. Science Press (2008) (in Chinese)"},{"key":"66_CR27","unstructured":"Yang, L., Zhang, J.: Searching dependency between algebraic equations: An algorithm applied to automated reasoning. In: International Centre for Theoretical Physics, pp. 1\u201312 (1990)"},{"key":"66_CR28","unstructured":"Yang, L., Zhang, J., Hou, X.: Non-linear algebraic formulae and theorem automated proving. Shanghai Education Technology Publishers (1992) (in Chinese)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Software \u2013 ICMS 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44199-2_66","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T09:36:35Z","timestamp":1558949795000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44199-2_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662441985","9783662441992"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44199-2_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}