{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T14:29:56Z","timestamp":1768400996586,"version":"3.49.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2014,4,5]],"date-time":"2014-04-05T00:00:00Z","timestamp":1396656000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s11424-014-2017-0","type":"journal-article","created":{"date-parts":[[2014,4,4]],"date-time":"2014-04-04T22:23:41Z","timestamp":1396650221000},"page":"1320-1344","source":"Crossref","is-referenced-by-count":9,"title":["Multiplicity-preserving triangular set decomposition of two polynomials"],"prefix":"10.1007","volume":"27","author":[{"given":"Jin-San","family":"Cheng","sequence":"first","affiliation":[]},{"given":"Xiao-Shan","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,4,5]]},"reference":[{"key":"2017_CR1","volume-title":"Differential Algebra","author":"J Ritt","year":"1966","unstructured":"Ritt J, Differential Algebra, New York, Dover Publications, 1966."},{"key":"2017_CR2","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02328447","volume":"2","author":"W T Wu","year":"1986","unstructured":"Wu W T, Basic principles of mechanical theorem-proving in elementary geometries, Journal Automated Reasoning, 1986, 2: 221\u2013252.","journal-title":"Journal Automated Reasoning"},{"key":"2017_CR3","volume-title":"Basic Principle of Mechanical Theorem Proving in Geometries","author":"W T Wu","year":"1984","unstructured":"Wu W T, Basic Principle of Mechanical Theorem Proving in Geometries, Science Press, Beijing, 1984; Springer, Wien, 1994 (in Chinese)."},{"issue":"1\u20132","key":"2017_CR4","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1006\/jsco.1999.0269","volume":"28","author":"P Aubry","year":"1999","unstructured":"Aubry P, Lazard D, and Moreno Maza M, On the theories of triangular sets, J. Symb. Comput., 1999, 28(1\u20132): 105\u2013124.","journal-title":"J. Symb. Comput."},{"key":"2017_CR5","first-page":"73","volume-title":"CASC","author":"C Chen","year":"2007","unstructured":"Chen C, Golubitsky O, Lemaire F, Moreno Maza M, and Pan W, Comprehensive triangular decomposition, CASC, 2007, 73\u2013101."},{"key":"2017_CR6","first-page":"207","volume":"449","author":"S C Chou","year":"1990","unstructured":"Chou S C and Gao X S, Ritt-Wu\u2019s decomposition algorithm and geometry theorem proving, CADE\u201910, ed. by Stickel M E, Lecture Notes in Computer Science, Springer-Verlag, 1990, 449: 207\u2013220.","journal-title":"CADE\u201910"},{"key":"2017_CR7","volume-title":"Proceedings of the 2005 International Symposium on Sympolic and Algebraic Computation, ACM, Beijing","author":"X Dahan","year":"2005","unstructured":"Dahan X, Moreno Maza M, Schost \u00c9, Wu W, and Xie Y, Lifting techniques for triangular decompositions, Proceedings of the 2005 International Symposium on Sympolic and Algebraic Computation, ACM, Beijing, 2005."},{"key":"2017_CR8","first-page":"799","volume":"38","author":"X S Gao","year":"1993","unstructured":"Gao X S and Chou S C, On the dimension of an arbitrary ascending chain, Chinese Sci. Bull., 1993, 38: 799\u2013804.","journal-title":"Chinese Sci. Bull."},{"issue":"5\u20136","key":"2017_CR9","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1016\/S0378-4754(97)00127-4","volume":"45","author":"V P Gerdt","year":"1998","unstructured":"Gerdt V P and Blinkov Y A, Involutive bases of polynomial ideals, Mathematics and Computers in Simulation, 1998, 45(5\u20136): 519\u2013541.","journal-title":"Mathematics and Computers in Simulation"},{"key":"2017_CR10","doi-asserted-by":"crossref","first-page":"3852","DOI":"10.1016\/j.jalgebra.2009.05.032","volume":"322","author":"O Golubitsky","year":"2009","unstructured":"Golubitsky O, Kondratieva M, Ovchinnikov A, and Szanto A, A bound for orders in differential Nullstellensatz. Journal of Algebra, 2009, 322: 3852\u20133877.","journal-title":"Journal of Algebra"},{"key":"2017_CR11","first-page":"1","volume":"2630","author":"E Hubert","year":"2003","unstructured":"Hubert E, Notes on triangular sets and triangulation-decomposition algorithms I: Polynomial systems, Chapter of Symbolic and Numerical Scientific Computations Edited by Langer U and Winkler F, Lecture Notes in Computer Science, Springer-Verlag Heidelberg, 2003, 2630: 1\u201339.","journal-title":"Notes on triangular sets and triangulation-decomposition algorithms I: Polynomial systems"},{"key":"2017_CR12","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0166-218X(91)90113-B","volume":"33","author":"D Lazard","year":"1991","unstructured":"Lazard D, A new method for solving algebraic systems of positive dimension, Discrete Appl. Math., 1991, 33: 147\u2013160.","journal-title":"Discrete Appl. Math."},{"key":"2017_CR13","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1145\/1277548.1277585","volume-title":"Proceedings of the 2007 International Symposium on Sympolic and Algebraic Computation, ACM","author":"X Li","year":"2007","unstructured":"Li X, Moreno Maza M, and Schost \u00c9, Fast arithmetic for triangular sets: From theory to practice, Proceedings of the 2007 International Symposium on Sympolic and Algebraic Computation, ACM, 2007, 269\u2013276."},{"key":"2017_CR14","volume-title":"MEGA-2000 Conference, Bath, England","author":"M Moreno Maza","year":"2000","unstructured":"Moreno Maza M, On triangular decompositions of algebraic varieties, MEGA-2000 Conference, Bath, England, 2000."},{"issue":"2","key":"2017_CR15","doi-asserted-by":"crossref","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 triangular representations of algebraic varieties, J. Symb. Comput., 1993, 15(2): 143\u2013167.","journal-title":"J. Symb. Comput."},{"key":"2017_CR16","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01225644","volume":"6","author":"M Kalkbrener","year":"1995","unstructured":"Kalkbrener M, Primitive polynomial remainder sequence in elimination theory, Applicable Algebra in Engineering, Communication and Computing, 1995, 6: 65\u201379.","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"issue":"5","key":"2017_CR17","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1006\/jsco.1998.0227","volume":"26","author":"M Kalkbrener","year":"1998","unstructured":"Kalkbrener M, Algorithmic properties of polynomial rings, J. Symb. Comput., 1998, 26(5): 525\u2013581.","journal-title":"J. Symb. Comput."},{"issue":"2","key":"2017_CR18","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1006\/jsco.1999.0355","volume":"30","author":"D Wang","year":"2000","unstructured":"Wang D, Computing triangular systems and regular systems, J. Symb. Comput., 2000, 30(2): 221\u2013236.","journal-title":"J. Symb. Comput."},{"issue":"1","key":"2017_CR19","first-page":"1","volume":"6","author":"W T Wu","year":"1993","unstructured":"Wu W T, On a linear equations method of non-linear polynomial equations-solving, Systems Science and Mathematical Sciences, 1993, 6(1): 1\u201312.","journal-title":"Systems Science and Mathematical Sciences"},{"key":"2017_CR20","first-page":"147","volume-title":"Artificial Intelligence in Mathematics","author":"L Yang","year":"1994","unstructured":"Yang L and Zhang J, Searching dependency between algebraic equations: An algorithm applied to automated reasoning, Artificial Intelligence in Mathematics, Oxford University Press, 1994, 147\u2013156."},{"key":"2017_CR21","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0747-7171(08)80086-7","volume":"13","author":"D Lazard","year":"1992","unstructured":"Lazard D, Solving zero-dimensional algebraic systems, J. Symb. Comput., 1992, 13: 117\u2013131.","journal-title":"J. Symb. Comput."},{"issue":"3","key":"2017_CR22","first-page":"98","volume":"5","author":"B H Li","year":"2003","unstructured":"Li B H, A method to solve algebraic equations up to multiplicities via Ritt-Wu\u2019s characteristic sets, Acta Analysis Functionalis Applicata, 2003, 5(3): 98\u2013109.","journal-title":"Acta Analysis Functionalis Applicata"},{"key":"2017_CR23","first-page":"19","volume-title":"The Third Computer Mathematics Conference of China, Shanghai, China, October","author":"Y Li","year":"2010","unstructured":"Li Y, Xia B, and Zhang Z, Zero decomposition with multiplicity of zero-dimensional polynomial systems (in Chinese), The Third Computer Mathematics Conference of China, Shanghai, China, October, 2010, 19\u201322."},{"issue":"4","key":"2017_CR24","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.jco.2006.04.003","volume":"22","author":"D Bates","year":"2006","unstructured":"Bates D, Peterson C, and Sommese A J, A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set, Journal of Complexity, 2006, 22(4): 475\u2013489.","journal-title":"Journal of Complexity"},{"key":"2017_CR25","volume-title":"Proceedings of the 2005 International Symposium on Sympolic and Algebraic Computation, ACM","author":"B Dayton","year":"2005","unstructured":"Dayton B and Zeng Z, Computing the multiplicity structure in solving polynomial systems, Proceedings of the 2005 International Symposium on Sympolic and Algebraic Computation, ACM, 2005."},{"key":"2017_CR26","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0747-7171(85)80035-3","volume":"1","author":"D Lazard","year":"1985","unstructured":"Lazard D, Ideal bases and primary decomposition: Case of two variables, J. Symb. Comput., 1985, 1: 261\u2013270.","journal-title":"J. Symb. Comput."},{"key":"2017_CR27","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/355791.355795","volume":"4","author":"W S Brown","year":"1978","unstructured":"Brown W S, The subresultant PRS algorithm, ACM Trans. on Mathematical Software, 1978, 4: 237\u2013249.","journal-title":"ACM Trans. on Mathematical Software"},{"key":"2017_CR28","doi-asserted-by":"crossref","unstructured":"Hodge W V D and Pedoe D, Methods of Algebraic Geometry, Volume II, University Press Cambridge, ISBN 0 521 46901 5 paperback, 1994.","DOI":"10.1017\/CBO9780511623875"},{"key":"2017_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-8176-4771-1","volume-title":"Discriminants, Resultants and Multidimensional Determinants","author":"I M Gel\u2019fand","year":"1994","unstructured":"Gel\u2019fand I M, Kapranov M, and Zelevinsky A. Discriminants, Resultants and Multidimensional Determinants, Boston, Birkh\u00e4user, 1994."},{"key":"2017_CR30","volume-title":"Using Algebraic Geometry","author":"D A Cox","year":"2004","unstructured":"Cox D A, Little J, and O\u2019Shea D, Using Algebraic Geometry, Springer, Second Edition, 2004.","edition":"Second Edition"},{"key":"2017_CR31","doi-asserted-by":"crossref","unstructured":"Hodge W V D and Pedoe D, Methods of algebraic geometry, Volume I, University Press Cambridge, ISBN 0 521 469007 4 paperback, 1994.","DOI":"10.1017\/CBO9780511623875"},{"key":"2017_CR32","doi-asserted-by":"crossref","DOI":"10.3792\/chmm\/1263317740","volume-title":"The Algebraic Theory of Modular Systems","author":"F S Macaulay","year":"1916","unstructured":"Macaulay F S, The Algebraic Theory of Modular Systems, Cambridge University Press, 1916, reprint 1994."},{"key":"2017_CR33","volume-title":"Algebraic Curves","author":"W Fulton","year":"2008","unstructured":"Fulton W, Algebraic Curves, The third version, online, 2008.","edition":"The third versi"},{"key":"2017_CR34","volume-title":"Transgressive Computing, Granada, Spain","author":"F Boulier","year":"2006","unstructured":"Boulier F, Lemaire F, and Moreno Maza M, Well known theorems on triangular systems and the D5 principle, Transgressive Computing, Granada, Spain, 2006."},{"key":"2017_CR35","first-page":"289","volume":"204","author":"J D Dora","year":"1985","unstructured":"Dora J D, Discrescenzo C, and Duval D, About a new method method for computing in algebraic number fields, EUROCAL\u201985, Lecture Notes in Computer Science, Springer-Verlag, 1985, 204: 289\u2013290.","journal-title":"About a new method method for computing in algebraic number fields"},{"key":"2017_CR36","unstructured":"Sun Y and Wang D K, An efficient algorithm for factoring polynomials over algebraic extension field, arXiv:0907.2300v2 [cs.SC]."},{"key":"2017_CR37","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1016\/j.jsc.2008.04.009","volume":"44","author":"D I Diochnos","year":"2009","unstructured":"Diochnos D I, Emiris I Z, and Tsigaridas E P, On the asymptotic and practical complexity of solving bivariate systems over the reals, J. Symb. Comput., 2009, 44: 818\u2013835.","journal-title":"J. Symb. Comput."},{"key":"2017_CR38","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1145\/258726.258792","volume-title":"Proceedings of the 1997 International Symposium on Sympolic and Algebraic Computation, ACM","author":"D Reischert","year":"1997","unstructured":"Reischert D, Asymptotically fast computation of subresultants, Proceedings of the 1997 International Symposium on Sympolic and Algebraic Computation, ACM, 1997, 233\u2013240."},{"key":"2017_CR39","doi-asserted-by":"crossref","DOI":"10.1142\/9781848161207","volume-title":"Elimination Practice, Software Tools, and Applications","author":"D Wang","year":"2004","unstructured":"Wang D, Elimination Practice, Software Tools, and Applications, Imperial College Press, 2004."},{"key":"2017_CR40","first-page":"67","volume-title":"Proc. ASCM, World Scientific","author":"D K Wang","year":"2000","unstructured":"Wang D K, Zero decomposition for system of polynomial equations, Proc. ASCM, World Scientific, 2000, 67\u201370."}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-014-2017-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-014-2017-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-014-2017-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T20:33:25Z","timestamp":1648758805000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-014-2017-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,5]]},"references-count":40,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["2017"],"URL":"https:\/\/doi.org\/10.1007\/s11424-014-2017-0","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,5]]}}}