{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T07:58:16Z","timestamp":1776067096320,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s00200-025-00721-6","type":"journal-article","created":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:25:15Z","timestamp":1773656715000},"page":"305-330","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sparse systems and algorithmic equidimensional decomposition"],"prefix":"10.1007","volume":"37","author":[{"given":"Mar\u00eda Isabel","family":"Herrero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriela","family":"Jeronimo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Sabia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,16]]},"reference":[{"key":"721_CR1","unstructured":"Basu, S., Pollack, R., Roy, M.-F.: Algorithms in real algebraic geometry. In: Algorithms and Computation in Mathematics, 10. Springer-Verlag, Berlin. Revised and completed version of 2nd edition (2016)"},{"key":"721_CR2","doi-asserted-by":"crossref","unstructured":"Bates, D.J., Hauenstein, J.D., Sommese, A.J., Wampler, C.W.: Numerically Solving Polynomial Systems with Bertini. Software Environ. Tools, vol. 25, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, (2013)","DOI":"10.1137\/1.9781611972702"},{"key":"721_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF01075595","volume":"9","author":"DN Bernstein","year":"1975","unstructured":"Bernstein, D.N.: The number of roots of a system of equations. Funct. Anal. Appl. 9, 183\u2013185 (1975)","journal-title":"Funct. Anal. Appl."},{"key":"721_CR4","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s11075-020-01045-x","volume":"88","author":"T Brysiewicz","year":"2021","unstructured":"Brysiewicz, T., Rodriguez, J.I., Sottile, F., Yahl, T.: Solving decomposable sparse systems. Numer. Algorithms 88, 453\u2013474 (2021)","journal-title":"Numer. Algorithms"},{"key":"721_CR5","doi-asserted-by":"crossref","unstructured":"B\u00fcrgisser, P., Claussen, M., Shokrollahi, M.: Algebraic complexity theory. With the collaboration of Thomas Lickteig. Grundlehren der mathematischen Wissenschaften, 315. Springer-Verlag, Berlin, (1997)","DOI":"10.1007\/978-3-662-03338-8"},{"key":"721_CR6","volume-title":"Subexponential Time Solving Systems of Algebraic Equations, LOMI preprint E-9-83, E-10-83","author":"AL Chistov","year":"1983","unstructured":"Chistov, A.L., Grigoriev, D.Y.: Subexponential Time Solving Systems of Algebraic Equations, LOMI preprint E-9-83, E-10-83. Steklov Institute, Leningrad (1983)"},{"key":"721_CR7","unstructured":"Cox, D.A., Little, J., O\u2019Shea, D.: Using algebraic geometry. Second edition. In: Graduate Texts in Mathematics, 185. Springer, New York, (2005)"},{"issue":"3","key":"721_CR8","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1093\/imanum\/dry017","volume":"39","author":"T Duff","year":"2019","unstructured":"Duff, T., Hill, C., Jensen, A., Lee, K., Leykin, A., Sommars, J.: Solving polynomial systems via homotopy continuation and monodromy. IMA J. Numer. Anal. 39(3), 1421\u20131446 (2019)","journal-title":"IMA J. Numer. Anal."},{"key":"721_CR9","doi-asserted-by":"crossref","unstructured":"Eder, C., Lairez, P., Mohr, R., Safey El Din, M.: A Direttissimo algorithm for equidimensional decomposition. In: ISSAC \u201923: Proc. of the 2023 International Symposium on Symbolic and Algebraic Computation, 260\u2013269","DOI":"10.1145\/3597066.3597069"},{"key":"721_CR10","doi-asserted-by":"crossref","unstructured":"Elkadi, M., Mourrain, B.: A new algorithm for the geometric decomposition of a variety. In: Proceedings of ISSAC\u201999, ACM, New York, 9\u201316, (1999)","DOI":"10.1145\/309831.309843"},{"key":"721_CR11","doi-asserted-by":"crossref","unstructured":"Emiris, I.Z., Verschelde, J.: How to count efficiently all affine roots of a polynomial system. In: 13th European Workshop on Computational Geometry CG\u201997. W\u00fcrzburg, 1997, Discrete Appl. Math. 93(1), 21\u201332 (1999)","DOI":"10.1016\/S0166-218X(99)00003-7"},{"key":"721_CR12","doi-asserted-by":"crossref","unstructured":"Giusti, M., Heintz, J.: Algorithmes - disons rapides - pour la d\u00e9composition d\u2019une vari\u00e9t\u00e9 alg\u00e9brique en composantes irr\u00e9ductibles et \u00e9quidimensionelles, in: T. Mora, C. Traverso (Eds.), Proceedings of MEGA\u201990, Progress in Mathematics, Vol. 94, Birkh\u00e4user, Basel, 169\u2013194 (1991)","DOI":"10.1007\/978-1-4612-0441-1_11"},{"key":"721_CR13","unstructured":"Giusti, M., Heintz, J.: La d\u00e9termination des points isol\u00e9s et de la dimension d\u2019une vari\u00e9t\u00e9 alg\u00e9brique peut se faire en temps polynomial. Computational algebraic geometry and commutative algebra (Cortona, 1991), Sympos. Math., XXXIV, 216\u2013256, Cambridge Univ. Press, Cambridge, 1993"},{"key":"721_CR14","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0022-4049(96)00099-0","volume":"124","author":"M Giusti","year":"1998","unstructured":"Giusti, M., Heintz, J., Morais, J.E., Morgenstern, J., Pardo, L.M.: Straight-line programs in geometric elimination theory. J. Pure Appl. Algebra 124, 101\u2013146 (1998)","journal-title":"J. Pure Appl. Algebra"},{"issue":"1","key":"721_CR15","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1006\/jcom.2000.0571","volume":"17","author":"M Giusti","year":"2001","unstructured":"Giusti, M., Lecerf, G., Salvy, B.: A Gr\u00f6bner free alternative for polynomial system solving. J. Complex. 17(1), 154\u2013211 (2001)","journal-title":"J. Complex."},{"issue":"3","key":"721_CR16","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0304-3975(83)90002-6","volume":"24","author":"J Heintz","year":"1983","unstructured":"Heintz, J.: Definability and fast quantifier elimination in algebraically closed fields. Theoret. Comput. Sci. 24(3), 239\u2013277 (1983)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"721_CR17","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1006\/jcom.1999.0529","volume":"16","author":"J Heintz","year":"2000","unstructured":"Heintz, J., Krick, T., Puddu, S., Sabia, J., Waissbein, A.: Deformation techniques for efficient polynomial equation solving. J. Complex. 16(1), 70\u2013109 (2000)","journal-title":"J. Complex."},{"issue":"44\u201346","key":"721_CR18","doi-asserted-by":"publisher","first-page":"3894","DOI":"10.1016\/j.tcs.2010.07.015","volume":"411","author":"MI Herrero","year":"2010","unstructured":"Herrero, M.I., Jeronimo, G., Sabia, J.: Computing isolated roots of sparse polynomial systems in affine space. Theoret. Comput. Sci. 411(44\u201346), 3894\u20133904 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"721_CR19","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.jsc.2012.03.006","volume":"51","author":"MI Herrero","year":"2013","unstructured":"Herrero, M.I., Jeronimo, G., Sabia, J.: Affine solution sets of sparse polynomial systems. J. Symbolic Comput. 51, 34\u201354 (2013)","journal-title":"J. Symbolic Comput."},{"issue":"212","key":"721_CR20","doi-asserted-by":"publisher","first-page":"1541","DOI":"10.1090\/S0025-5718-1995-1297471-4","volume":"64","author":"B Huber","year":"1995","unstructured":"Huber, B., Sturmfels, B.: A polyhedral method for solving sparse polynomial systems. Math. Comp. 64(212), 1541\u20131555 (1995)","journal-title":"Math. Comp."},{"issue":"2","key":"721_CR21","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF02770870","volume":"17","author":"B Huber","year":"1997","unstructured":"Huber, B., Sturmfels, B.: Bernstein\u2019s theorem in affine space. Discrete Comput. Geom. 17(2), 137\u2013141 (1997)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"721_CR22","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10208-002-0078-2","volume":"4","author":"G Jeronimo","year":"2004","unstructured":"Jeronimo, G., Krick, T., Sabia, J., Sombra, M.: The computational complexity of the Chow form. Found. Comput. Math. 4(1), 41\u2013117 (2004)","journal-title":"Found. Comput. Math."},{"issue":"1","key":"721_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10208-008-9024-2","volume":"9","author":"G Jeronimo","year":"2009","unstructured":"Jeronimo, G., Matera, G., Solern\u00f3, P., Waissbein, A.: Deformation techniques for sparse systems. Found. Comput. Math. 9(1), 1\u201350 (2009)","journal-title":"Found. Comput. Math."},{"issue":"2\u20133","key":"721_CR24","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0022-4049(01)00083-4","volume":"169","author":"G Jeronimo","year":"2002","unstructured":"Jeronimo, G., Sabia, J.: Effective equidimensional decomposition of affine varieties. J. Pure Appl. Algebra 169(2\u20133), 229\u2013248 (2002)","journal-title":"J. Pure Appl. Algebra"},{"key":"721_CR25","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01077143","volume":"11","author":"AG Khovanskii","year":"1978","unstructured":"Khovanskii, A.G.: Newton polyhedra and toroidal varieties. Funct. Anal. Appl. 11, 289\u2013296 (1978)","journal-title":"Funct. Anal. Appl."},{"key":"721_CR26","first-page":"1","volume":"92","author":"L Kronecker","year":"1882","unstructured":"Kronecker, L.: Grundz\u00fcge einer arithmetischen Theorie der algebraischen Gr\u00f6ssen. J. Reine Angew. Math. 92, 1\u2013122 (1882)","journal-title":"J. Reine Angew. Math."},{"key":"721_CR27","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF01075534","volume":"10","author":"AG Kushnirenko","year":"1976","unstructured":"Kushnirenko, A.G.: Newton polytopes and the Bezout theorem. Funct. Anal. Appl. 10, 233\u2013235 (1976)","journal-title":"Funct. Anal. Appl."},{"key":"721_CR28","doi-asserted-by":"crossref","unstructured":"Lecerf, G.: Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions. Proceedings of the 2000 international symposium on symbolic and algebraic computation. In: ISSAC \u201900, St. Andrews, Scotland, GB, 2000. New York, NY: ACM Press (2000), 209-216","DOI":"10.1145\/345542.345633"},{"issue":"4","key":"721_CR29","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/S0885-064X(03)00031-1","volume":"19","author":"G Lecerf","year":"2003","unstructured":"Lecerf, G.: Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers. J. Complex. 19(4), 564\u2013596 (2003)","journal-title":"J. Complex."},{"issue":"216","key":"721_CR30","doi-asserted-by":"publisher","first-page":"1477","DOI":"10.1090\/S0025-5718-96-00778-8","volume":"65","author":"TY Li","year":"1996","unstructured":"Li, T.Y., Wang, X.: The BKK root count in $${\\mathbb{C}}^n$$. Math. Comp. 65(216), 1477\u20131484 (1996)","journal-title":"Math. Comp."},{"issue":"3","key":"721_CR31","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s00454-006-1300-9","volume":"37","author":"T Mizutani","year":"2007","unstructured":"Mizutani, T., Takeda, A., Kojima, M.: Dynamic enumeration of all mixed cells. Discrete Comput. Geom. 37(3), 351\u2013367 (2007)","journal-title":"Discrete Comput. Geom."},{"key":"721_CR32","doi-asserted-by":"crossref","unstructured":"Rojas, J.M.: Why polyhedra matter in non-linear equation solving. In: Topics in Algebraic Geometry and Geometric Modeling. In: Contemp. Math., vol. 334. Amer. Math. Soc., Providence, RI, 293\u2013320 (2003)","DOI":"10.1090\/conm\/334\/05987"},{"key":"721_CR33","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s00200-002-0109-x","volume":"13","author":"E Schost","year":"2003","unstructured":"Schost, E.: Computing parametric geometric resolutions. Appl. Algebra Eng. Commun. Comput. 13, 349\u2013393 (2003)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"721_CR34","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J Schwartz","year":"1980","unstructured":"Schwartz, J.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27, 701\u2013717 (1980)","journal-title":"J. ACM"},{"key":"721_CR35","doi-asserted-by":"publisher","DOI":"10.1142\/5763","volume-title":"The Numerical Solution of Systems of Polynomials Arising in Engineering and Science","author":"AJ Sommese","year":"2005","unstructured":"Sommese, A.J., Wampler, C.W.: The Numerical Solution of Systems of Polynomials Arising in Engineering and Science. World Scientific Publishing Co. Pte. Ltd., Hackensack (2005)"},{"key":"721_CR36","doi-asserted-by":"crossref","unstructured":"Sottile, F.: General witness sets for numerical algebraic geometry. In: ISSAC\u201920\u2014Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation, ACM, New York, 418\u2013425 (2020)","DOI":"10.1145\/3373207.3403995"},{"issue":"1","key":"721_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10208-020-09453-0","volume":"21","author":"J van der Hoeven","year":"2021","unstructured":"van der Hoeven, J., Lecerf, G.: On the complexity exponent of polynomial system solving. Found. Comput. Math. 21(1), 1\u201357 (2021)","journal-title":"Found. Comput. Math."},{"issue":"3","key":"721_CR38","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1137\/0731049","volume":"31","author":"J Verschelde","year":"1994","unstructured":"Verschelde, J., Verlinden, P., Cools, R.: Homotopies exploiting Newton polytopes for solving sparse polynomial systems. SIAM J. Numer. Anal. 31(3), 915\u2013930 (1994)","journal-title":"SIAM J. Numer. Anal."},{"key":"721_CR39","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139856065","volume-title":"Modern Computer Algebra","author":"J von zur Gathen","year":"2013","unstructured":"von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 3rd edn. Cambridge University Press, Cambridge (2013)","edition":"3"},{"key":"721_CR40","doi-asserted-by":"crossref","unstructured":"Zippel, R.: Effective Polynomial Computation. Kluwer Int. Ser. Eng. Comput. Sci., vol. 241. Kluwer, Dordrecht, (1993)","DOI":"10.1007\/978-1-4615-3188-3"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-025-00721-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-025-00721-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-025-00721-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T07:22:38Z","timestamp":1776064958000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-025-00721-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["721"],"URL":"https:\/\/doi.org\/10.1007\/s00200-025-00721-6","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]},"assertion":[{"value":"30 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}