{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T03:57:03Z","timestamp":1775102223840,"version":"3.50.1"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,2,22]],"date-time":"2008-02-22T00:00:00Z","timestamp":1203638400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s10208-008-9024-2","type":"journal-article","created":{"date-parts":[[2008,2,21]],"date-time":"2008-02-21T09:55:25Z","timestamp":1203587725000},"page":"1-50","source":"Crossref","is-referenced-by-count":30,"title":["Deformation Techniques for Sparse Systems"],"prefix":"10.1007","volume":"9","author":[{"given":"Gabriela","family":"Jeronimo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillermo","family":"Matera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pablo","family":"Solern\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ariel","family":"Waissbein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,2,22]]},"reference":[{"key":"9024_CR1","series-title":"Springer Ser. Comput. Math.","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61257-2","volume-title":"Numerical Continuation Methods: An Introduction","author":"E.L. Allgower","year":"1990","unstructured":"E.L. Allgower, K. Georg, Numerical Continuation Methods: An Introduction. Springer Ser. Comput. Math., vol.\u00a013 (Springer, New York, 1990)."},{"key":"9024_CR2","series-title":"Prog. Math.","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-0348-9104-2_1","volume-title":"Algorithms in Algebraic Geometry and Applications, Proceedings of MEGA\u201994","author":"M.E. Alonso","year":"1996","unstructured":"M.E. Alonso, E. Becker, M.-F. Roy, T. W\u00f6rmann, Zeros, multiplicities and idempotents for zero-dimensional systems, in Algorithms in Algebraic Geometry and Applications, Proceedings of MEGA\u201994. Prog. Math., vol.\u00a0143 (Birkh\u00e4user, Boston, 1996), pp.\u00a01\u201315."},{"key":"9024_CR3","series-title":"Monogr. Theor. Comput. Sci. EATCS Ser.","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97062-7","volume-title":"Structural Complexity I","author":"J.L. Balc\u00e1zar","year":"1988","unstructured":"J.L. Balc\u00e1zar, J. D\u00edaz, J. Gabarr\u00f3, Structural Complexity I. Monogr. Theor. Comput. Sci. EATCS Ser., vol.\u00a011 (Springer, Berlin, 1988)."},{"key":"9024_CR4","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0304-3975(83)90110-X","volume":"22","author":"W. Baur","year":"1983","unstructured":"W. Baur, V. Strassen, The complexity of partial derivatives, Theor. Comput. Sci. 22, 317\u2013330 (1983).","journal-title":"Theor. Comput. Sci."},{"key":"9024_CR5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF01075595","volume":"9","author":"D.N. Bernstein","year":"1975","unstructured":"D.N. Bernstein, The number of roots of a system of equations, Funct. Anal. Appl. 9, 183\u2013185 (1975).","journal-title":"Funct. Anal. Appl."},{"key":"9024_CR6","series-title":"Progress in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0265-3","volume-title":"Polynomial and Matrix Computations","author":"D. Bini","year":"1994","unstructured":"D. Bini, V. Pan, Polynomial and Matrix Computations. Progress in Theoretical Computer Science (Birkh\u00e4user, Boston, 1994)."},{"key":"9024_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0701-6","volume-title":"Complexity and Real Computation","author":"L. Blum","year":"1998","unstructured":"L. Blum, F. Cucker, M. Shub, S. Smale, Complexity and Real Computation (Springer, New York, 1998)."},{"issue":"2\u20133","key":"9024_CR8","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/j.tcs.2004.01.015","volume":"315","author":"A. Bompadre","year":"2004","unstructured":"A. Bompadre, G. Matera, R. Wachenchauzer, A. Waissbein, Polynomial equation solving by lifting procedures for ramified fibers, Theoret. Comput. Sci. 315(2\u20133), 335\u2013369 (2004).","journal-title":"Theoret. Comput. Sci."},{"key":"9024_CR9","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/860854.860870","volume-title":"Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC\u201903)","author":"A. Bostan","year":"2003","unstructured":"A. Bostan, G. Lecerf, E. Schost, Tellegen\u2019s principle into practice, in Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC\u201903), Philadelphia, PA, 3\u20136 August 2003, ed. by J.R. Sendra (ACM Press, New York, 2003), pp. 37\u201344."},{"issue":"4","key":"9024_CR10","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/j.jco.2004.09.009","volume":"21","author":"A. Bostan","year":"2005","unstructured":"A. Bostan, E. Schost, Polynomial evaluation and interpolation on special sets of points, J.\u00a0Complexity 21(4), 420\u2013446 (2005).","journal-title":"J.\u00a0Complexity"},{"key":"9024_CR11","series-title":"Grundlehren Math. Wiss.","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03338-8","volume-title":"Algebraic Complexity Theory","author":"P. B\u00fcrgisser","year":"1997","unstructured":"P. B\u00fcrgisser, M. Clausen, M.A. Shokrollahi, Algebraic Complexity Theory. Grundlehren Math. Wiss., vol.\u00a0315 (Springer, Berlin, 1997)."},{"key":"9024_CR12","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/ITW.2006.1633775","volume-title":"Proceedings of the 2006 Information Theory Workshop, ITW2006","author":"A. Cafure","year":"2006","unstructured":"A. Cafure, G. Matera, A. Waissbein, Inverting bijective polynomial maps over finite fields, in Proceedings of the 2006 Information Theory Workshop, ITW2006, Punta del Este, Uruguay, 13\u201317 March 2006, ed. by G. Seroussi, A. Viola (IEEE Information Theory Society, New York, 2006), pp.\u00a027\u201331."},{"issue":"4","key":"9024_CR13","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10208-002-0065-7","volume":"3","author":"D. Castro","year":"2003","unstructured":"D. Castro, M. Giusti, J. Heintz, G. Matera, L.M. Pardo, The hardness of polynomial equation solving, Found. Comput. Math. 3(4), 347\u2013420 (2003).","journal-title":"Found. Comput. Math."},{"key":"9024_CR14","series-title":"Grad. Texts in Math.","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-6911-1","volume-title":"Using Algebraic Geometry","author":"D. Cox","year":"1998","unstructured":"D. Cox, J. Little, D. O\u2019Shea, Using Algebraic Geometry. Grad. Texts in Math., vol.\u00a0185 (Springer, New York, 1998)."},{"key":"9024_CR15","first-page":"267","volume-title":"Foundations of Computational Mathematics","author":"J.-P. Dedieu","year":"1997","unstructured":"J.-P. Dedieu, Condition number analysis for sparse polynomial systems, in Foundations of Computational Mathematics, Rio de Janeiro, 1997, ed. by F. Cucker, M. Shub (Springer, Berlin, 1997), pp.\u00a0267\u2013276."},{"key":"9024_CR16","unstructured":"C. Durvye, G. Lecerf, A concise proof of the Kronecker polynomial system solver from scratch, Exp. Math. (2006, in press). doi: 10.1016\/j.expmath.2007.07.001 ."},{"key":"9024_CR17","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1006\/jsco.1995.1041","volume":"20","author":"I.Z. Emiris","year":"1995","unstructured":"I.Z. Emiris, J. Canny, Efficient incremental algorithms for the sparse resultant and the mixed volume, J.\u00a0Symb. Comput. 20, 117\u2013149 (1995).","journal-title":"J.\u00a0Symb. Comput."},{"key":"9024_CR18","series-title":"Grad. Texts in Math.","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4044-0","volume-title":"Combinatorial Convexity and Algebraic Geometry","author":"G. Ewald","year":"1996","unstructured":"G. Ewald, Combinatorial Convexity and Algebraic Geometry. Grad. Texts in Math., vol.\u00a0168 (Springer, New York, 1996)."},{"key":"9024_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-8176-4771-1","volume-title":"Discriminants, Resultants, and Multidimensional Determinants","author":"I.M. Gelfand","year":"1994","unstructured":"I.M. Gelfand, M.M. Kapranov, A.V. Zelevinsky, Discriminants, Resultants, and Multidimensional Determinants (Birkh\u00e4user, Boston, 1994)."},{"key":"9024_CR20","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0022-4049(97)00015-7","volume":"117\u2013118","author":"M. Giusti","year":"1997","unstructured":"M. Giusti, K. H\u00e4gele, J. Heintz, J.E. Morais, J.L. Monta\u00f1a, L.M. Pardo, Lower bounds for Diophantine approximation, J.\u00a0Pure Appl. Algebra 117\u2013118, 277\u2013317 (1997).","journal-title":"J.\u00a0Pure Appl. Algebra"},{"key":"9024_CR21","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0022-4049(96)00099-0","volume":"124","author":"M. Giusti","year":"1998","unstructured":"M. Giusti, J. Heintz, J.E. Morais, J. Morgenstern, L.M. Pardo, Straight-line programs in geometric elimination theory, J.\u00a0Pure Appl. Algebra 124, 101\u2013146 (1998).","journal-title":"J.\u00a0Pure Appl. Algebra"},{"issue":"1","key":"9024_CR22","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1006\/jcom.2000.0571","volume":"17","author":"M. Giusti","year":"2001","unstructured":"M. Giusti, G. Lecerf, B. Salvy, A Gr\u00f6bner free alternative for polynomial system solving, J.\u00a0Complex. 17(1), 154\u2013211 (2001).","journal-title":"J.\u00a0Complex."},{"key":"9024_CR23","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/3-540-51082-6_85","volume-title":"Proceedings of the 5th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-5","author":"J. Heintz","year":"1989","unstructured":"J. Heintz, On the computational complexity of polynomials and bilinear maps, in Proceedings of the 5th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-5, Menorca, Spain, 15\u201319 June 1987, ed. by L. Huguet, A. Poli. Lecture Notes in Comput. Sci., vol.\u00a0356 (Springer, Berlin, 1989), pp. 269\u2013300."},{"key":"9024_CR24","unstructured":"J. Heintz, G. Jeronimo, J. Sabia, P. Solern\u00f3, Intersection theory and deformation algorithms. The multihomogeneous case, Manuscript, Universidad de Buenos Aires, 2002."},{"issue":"1","key":"9024_CR25","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1006\/jcom.1999.0529","volume":"16","author":"J. Heintz","year":"2000","unstructured":"J. Heintz, T. Krick, S. Puddu, J. Sabia, A. Waissbein, Deformation techniques for efficient polynomial equation solving, J.\u00a0Complex. 16(1), 70\u2013109 (2000).","journal-title":"J.\u00a0Complex."},{"issue":"212","key":"9024_CR26","doi-asserted-by":"crossref","first-page":"1541","DOI":"10.1090\/S0025-5718-1995-1297471-4","volume":"64","author":"B. Huber","year":"1995","unstructured":"B. Huber, B. Sturmfels, A\u00a0polyhedral method for solving sparse polynomial systems, Math. Comput. 64(212), 1541\u20131555 (1995).","journal-title":"Math. Comput."},{"key":"9024_CR27","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF02770870","volume":"17","author":"B. Huber","year":"1997","unstructured":"B. Huber, B. Sturmfels, Bernstein\u2019s theorem in affine space, Discrete Comput. Geom. 17, 137\u2013141 (1997).","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"9024_CR28","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s10208-002-0078-2","volume":"4","author":"G. Jeronimo","year":"2004","unstructured":"G. Jeronimo, T. Krick, J. Sabia, M. Sombra, The computational complexity of the Chow form, Found. Comput. Math. 4(1), 41\u2013117 (2004).","journal-title":"Found. Comput. Math."},{"key":"9024_CR29","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/BF01077562","volume":"12","author":"A.G. Khovanski","year":"1978","unstructured":"A.G. Khovanski, Newton polyhedra and the genus of complete intersections, Funct. Anal. Appl. 12, 38\u201346 (1978).","journal-title":"Funct. Anal. Appl."},{"key":"9024_CR30","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01075534","volume":"10","author":"A.G. Kushnirenko","year":"1976","unstructured":"A.G. Kushnirenko, Newton polytopes and the B\u00e9zout theorem, Funct. Anal. Appl. 10, 233\u2013235 (1976).","journal-title":"Funct. Anal. Appl."},{"issue":"3","key":"9024_CR31","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s102080010026","volume":"2","author":"G. Lecerf","year":"2002","unstructured":"G. Lecerf, Quadratic Newton iteration for systems with multiplicity, Found. Comput. Math. 2(3), 247\u2013293 (2002).","journal-title":"Found. Comput. Math."},{"issue":"4","key":"9024_CR32","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/S0885-064X(03)00031-1","volume":"19","author":"G. Lecerf","year":"2003","unstructured":"G. Lecerf, Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers, J.\u00a0Complex. 19(4), 564\u2013596 (2003).","journal-title":"J.\u00a0Complex."},{"issue":"2","key":"9024_CR33","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s102080010005","volume":"1","author":"T.-Y. Li","year":"2001","unstructured":"T.-Y. Li, X. Li, Finding mixed cells in the mixed volume computation, Found. Comput. Math. 1(2), 161\u2013181 (2001).","journal-title":"Found. Comput. Math."},{"key":"9024_CR34","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1017\/S0962492900002749","volume":"6","author":"T.Y. Li","year":"1997","unstructured":"T.Y. Li, Numerical solution of multivariate polynomial systems by homotopy continuation methods, Acta Numer. 6, 399\u2013436 (1997).","journal-title":"Acta Numer."},{"issue":"216","key":"9024_CR35","doi-asserted-by":"crossref","first-page":"1477","DOI":"10.1090\/S0025-5718-96-00778-8","volume":"65","author":"T.Y. Li","year":"1996","unstructured":"T.Y. Li, X. Wang, The BKK root count in \u2102 n , Math. Comput. 65(216), 1477\u20131484 (1996).","journal-title":"Math. Comput."},{"issue":"2\u20133","key":"9024_CR36","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/j.tcs.2004.01.006","volume":"315","author":"G. Malajovich","year":"2004","unstructured":"G. Malajovich, J.M. Rojas, High probability analysis of the condition number of sparse polynomial systems, Theor. Comput. Sci. 315(2\u20133), 525\u2013555 (2004).","journal-title":"Theor. Comput. Sci."},{"key":"9024_CR37","volume-title":"Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems","author":"A. Morgan","year":"1987","unstructured":"A. Morgan, Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems (Prentice-Hall, Englewood Cliffs, 1987)."},{"key":"9024_CR38","doi-asserted-by":"crossref","first-page":"1308","DOI":"10.1137\/0732061","volume":"32","author":"A. Morgan","year":"1995","unstructured":"A. Morgan, A. Sommese, C. Wampler, A\u00a0generic product\u2013decomposition formula for B\u00e9zout numbers, SIAM J. Numer. Anal. 32, 1308\u20131325 (1995).","journal-title":"SIAM J. Numer. Anal."},{"key":"9024_CR39","volume-title":"Non-Degenerate Complete Intersection Singularity","author":"M. Oka","year":"1997","unstructured":"M. Oka, Non-Degenerate Complete Intersection Singularity (Hermann, Paris, 1997)."},{"key":"9024_CR40","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/3-540-60114-7_4","volume-title":"Applied Algebra, Algebraic Algorithms and Error Correcting Codes, Proceedings of AAECC-11","author":"L.M. Pardo","year":"1995","unstructured":"L.M. Pardo, How lower and upper complexity bounds meet in elimination theory, in Applied Algebra, Algebraic Algorithms and Error Correcting Codes, Proceedings of AAECC-11, ed. by G. Cohen, M. Giusti, T. Mora. Lecture Notes in Comput. Sci., vol. 948 (Springer, Berlin, 1995), pp. 33\u201369."},{"issue":"2\u20133","key":"9024_CR41","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/j.tcs.2004.01.009","volume":"315","author":"L.M. Pardo","year":"2004","unstructured":"L.M. Pardo, J. San Mart\u00edn, Deformation techniques to solve generalized Pham systems, Theoret. Comput. Sci. 315(2\u20133), 593\u2013625 (2004).","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"9024_CR42","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF02572411","volume":"214","author":"P. Pedersen","year":"1993","unstructured":"P. Pedersen, B. Sturmfels, Product formulas for resultants and Chow forms, Math. Z. 214(3), 377\u2013396 (1993).","journal-title":"Math. Z."},{"key":"9024_CR43","doi-asserted-by":"crossref","unstructured":"P. Philippon, M. Sombra, Hauteur normalis\u00e9e des vari\u00e9t\u00e9s toriques projectives, J. Inst. Math. Jussieu (2003, in press). doi: 10.1017\/S1474748007000138 , 35pp., eprint math.NT\/0406476.","DOI":"10.1017\/S1474748007000138"},{"key":"9024_CR44","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/j.crma.2005.02.018","volume":"340","author":"P. Philippon","year":"2005","unstructured":"P. Philippon, M. Sombra, G\u00e9om\u00e9trie Diophantienne et vari\u00e9t\u00e9s toriques, C.\u00a0R. Math. Acad. Sci. Paris 340, 507\u2013512 (2005).","journal-title":"C.\u00a0R. Math. Acad. Sci. Paris"},{"key":"9024_CR45","unstructured":"P. Philippon, M. Sombra, A refinement of the Ku\u0161nirenko\u2013Bern\u0161tein estimate, Manuscript, 2006. arXiv:0709.3306."},{"issue":"1\/2","key":"9024_CR46","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1006\/jsco.1998.0271","volume":"28","author":"J.M. Rojas","year":"1999","unstructured":"J.M. Rojas, Solving degenerate sparse polynomial systems faster, J.\u00a0Symbolic Comput. 28(1\/2), 155\u2013186 (1999).","journal-title":"J.\u00a0Symbolic Comput."},{"key":"9024_CR47","series-title":"Contemp. Math.","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/conm\/270\/04379","volume-title":"Proceedings of a Conference on Hilbert\u2019s Tenth Problem and Related Subjects","author":"J.M. Rojas","year":"2000","unstructured":"J.M. Rojas, Algebraic geometry over four rings and the frontier of tractability, in Proceedings of a Conference on Hilbert\u2019s Tenth Problem and Related Subjects, University of Gent, 1\u20135 November 1999, ed. by J. Denef et al. Contemp. Math., vol.\u00a0270 (AMS, Providence, 2000), pp.\u00a0275\u2013321"},{"key":"9024_CR48","series-title":"Contemp. Math.","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1090\/conm\/334\/05987","volume-title":"Proceedings of the Conference on Algebraic Geometry and Geometric Modelling","author":"J.M. Rojas","year":"2003","unstructured":"J.M. Rojas, Why polyhedra matter in non-linear equation solving, in Proceedings of the Conference on Algebraic Geometry and Geometric Modelling, Vilnius, Lithuania, 29 July\u20132 August 2002. Contemp. Math., vol.\u00a0334 (AMS, Providence, 2003), pp. 293\u2013320."},{"issue":"2","key":"9024_CR49","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1006\/jcom.1996.0009","volume":"12","author":"J.M. Rojas","year":"1996","unstructured":"J.M. Rojas, X. Wang, Counting affine roots of polynomial systems via pointed Newton polytopes, J.\u00a0Complex. 12(2), 116\u2013133 (1996).","journal-title":"J.\u00a0Complex."},{"issue":"6","key":"9024_CR50","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01198015","volume":"6","author":"J. Sabia","year":"1996","unstructured":"J. Sabia, P. Solern\u00f3, Bounds for traces in complete intersections and degrees in the Nullstellensatz, Appl. Algebra Eng. Commun. Comput. 6(6), 353\u2013376 (1996).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"9024_CR51","volume-title":"Models of Computation. Exploring the Power of Computing","author":"J.E. Savage","year":"1998","unstructured":"J.E. Savage, Models of Computation. Exploring the Power of Computing (Addison-Wesley, Reading, 1998)."},{"key":"9024_CR52","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s00200-002-0109-x","volume":"13","author":"E. Schost","year":"2003","unstructured":"E. Schost, Computing parametric geometric resolutions, Appl. Algebra Eng. Commun. Comput. 13, 349\u2013393 (2003).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"9024_CR53","doi-asserted-by":"crossref","DOI":"10.1142\/5763","volume-title":"The Numerical Solution of Systems of Polynomials Arising in Engineering and Science","author":"A. Sommese","year":"2005","unstructured":"A. Sommese, C. Wampler, The Numerical Solution of Systems of Polynomials Arising in Engineering and Science (World Scientific, Singapore, 2005)."},{"key":"9024_CR54","unstructured":"A. Storjohann, Algorithms for matrix canonical forms, Ph.D. thesis, ETH, Z\u00fcrich, Switzerland, 2000."},{"key":"9024_CR55","first-page":"634","volume-title":"Handbook of Theoretical Computer Science","author":"V. Strassen","year":"1990","unstructured":"V. Strassen, Algebraic complexity theory, in Handbook of Theoretical Computer Science, ed. by J. van Leeuwen (Elsevier, Amsterdam, 1990), pp.\u00a0634\u2013671."},{"issue":"1","key":"9024_CR56","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF02711134","volume":"16","author":"J. Verschelde","year":"1996","unstructured":"J. Verschelde, K. Gatermann, R. Cools, Mixed volume computation by dynamic lifting applied to polynomial system solving, Discrete Comput. Geom. 16(1), 69\u2013112 (1996).","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"9024_CR57","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1137\/0731049","volume":"31","author":"J. Verschelde","year":"1994","unstructured":"J. Verschelde, P. Verlinden, R. Cools, 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":"9024_CR58","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BFb0016236","volume-title":"Proceedings of the 12th International Symposium on Mathematical Foundations of Computer Science","author":"J. zur Gathen von","year":"1986","unstructured":"J. von zur Gathen, Parallel arithmetic computations: a survey, in Proceedings of the 12th International Symposium on Mathematical Foundations of Computer Science, Bratislava, Czechoslovakia, 25\u201329 August 1986, ed. by J. Gruska, B. Rovan, J. Wiedermann. Lecture Notes in Comput. Sci., vol. 233 (Springer, Berlin, 1986), pp.\u00a093\u2013112."},{"key":"9024_CR59","volume-title":"Modern Computer Algebra","author":"J. zur Gathen von","year":"1999","unstructured":"J. von zur Gathen, J. Gerhard, Modern Computer Algebra (Cambridge University Press, Cambridge, 1999)."},{"key":"9024_CR60","volume-title":"Algebraic Curves","author":"R.J. Walker","year":"1950","unstructured":"R.J. Walker, Algebraic Curves (Dover, New York, 1950)."},{"key":"9024_CR61","series-title":"Kluwer Int. Ser. Eng. Comput. Sci.","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3188-3","volume-title":"Effective Polynomial Computation","author":"R. Zippel","year":"1993","unstructured":"R. Zippel, Effective Polynomial Computation. Kluwer Int. Ser. Eng. Comput. Sci., vol.\u00a0241 (Kluwer, Dordrecht, 1993)."}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-008-9024-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-008-9024-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-008-9024-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,4]],"date-time":"2021-09-04T13:25:26Z","timestamp":1630761926000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-008-9024-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2,22]]},"references-count":61,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["9024"],"URL":"https:\/\/doi.org\/10.1007\/s10208-008-9024-2","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,2,22]]}}}