{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T22:33:58Z","timestamp":1773700438804,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,1,10]],"date-time":"2021-01-10T00:00:00Z","timestamp":1610236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,10]],"date-time":"2021-01-10T00:00:00Z","timestamp":1610236800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["636314"],"award-info":[{"award-number":["636314"]}],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s11075-020-01045-x","type":"journal-article","created":{"date-parts":[[2021,1,10]],"date-time":"2021-01-10T07:02:30Z","timestamp":1610262150000},"page":"453-474","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Solving decomposable sparse systems"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3140-9944","authenticated-orcid":false,"given":"Taylor","family":"Brysiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose Israel","family":"Rodriguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Sottile","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Yahl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,10]]},"reference":[{"key":"1045_CR1","unstructured":"Am\u00e9ndola, C., Rodriguez, J.I.: Solving parameterized polynomial systems with decomposable projections. arXiv:1612.08807 (2016)"},{"key":"1045_CR2","doi-asserted-by":"crossref","unstructured":"Bates, D. J., Hauenstein, J. D., Sommese, A. J.: A parallel endgame. In: Randomization, relaxation, and complexity in polynomial equation solving. Contemp. Math., vol. 556, pp 25\u201335. Amer. Math. Soc., Providence (2011)","DOI":"10.1090\/conm\/556\/11006"},{"issue":"3","key":"1045_CR3","first-page":"1","volume":"9","author":"DN Bernstein","year":"1975","unstructured":"Bernstein, D. N.: The number of roots of a system of equations. Funkcional Anal. i Prilo\u017een 9(3), 1\u20134 (1975)","journal-title":"Funkcional Anal. i Prilo\u017een"},{"key":"1045_CR4","doi-asserted-by":"crossref","unstructured":"Brysiewicz, T., Rodriguez, J.I., Sottile, F., Yahl, T.: Software for decomposable sparse polynomial systems, https:\/\/www.math.tamu.edu\/~thomasjyahl\/research\/DSS\/DSSsite.html (2020)","DOI":"10.2140\/jsag.2021.11.53"},{"key":"1045_CR5","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s00454-019-00078-x","volume":"62","author":"T Chen","year":"2019","unstructured":"Chen, T.: Unmixing the mixed volume computation. Discrete Comput. Geom. 62, 55\u201386 (2019)","journal-title":"Discrete Comput. Geom."},{"key":"1045_CR6","volume-title":"Computational Invariant Theory. Invariant Theory and Algebraic Transformation Groups, I","author":"H Derksen","year":"2002","unstructured":"Derksen, H., Kemper, G.: Computational Invariant Theory. Invariant Theory and Algebraic Transformation Groups, I. Springer, Berlin (2002). Encyclopaedia of Mathematical Sciences, 130"},{"issue":"3","key":"1045_CR7","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."},{"issue":"2","key":"1045_CR8","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1112\/S0010437X18007868","volume":"155","author":"A Esterov","year":"2019","unstructured":"Esterov, A.: Galois theory for general systems of polynomial equations. Compos. Math. 155(2), 229\u2013245 (2019)","journal-title":"Compos. Math."},{"key":"1045_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4044-0","volume-title":"Combinatorial convexity and algebraic geometry. Graduate Texts in Mathematics, vol. 168","author":"G Ewald","year":"1996","unstructured":"Ewald, G.: Combinatorial convexity and algebraic geometry. Graduate Texts in Mathematics, vol. 168. Springer, New York (1996)"},{"issue":"1","key":"1045_CR10","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF01582106","volume":"16","author":"CB Garcia","year":"1979","unstructured":"Garcia, C. B., Zangwill, W. I.: Finding all solutions to polynomial systems and other systems of equations. Math. Program. 16(1), 159\u2013176 (1979)","journal-title":"Math. Program."},{"key":"1045_CR11","doi-asserted-by":"publisher","first-page":"20","DOI":"10.2140\/jsag.2013.5.20","volume":"5","author":"E Gross","year":"2013","unstructured":"Gross, E., Petrovi\u0107, S., Verschelde, J.: Interfacing with PHCpack. J. Softw. Algebra Geom. 5, 20\u201325 (2013)","journal-title":"J. Softw. Algebra Geom."},{"issue":"4","key":"1045_CR12","first-page":"685","volume":"46","author":"J Harris","year":"1979","unstructured":"Harris, J.: Galois groups of enumerative problems. Duke Math. J. 46(4), 685\u2013724 (1979)","journal-title":"Duke Math. J."},{"issue":"4","key":"1045_CR13","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/2331130.2331136","volume":"38","author":"JD Hauenstein","year":"2012","unstructured":"Hauenstein, J. D., Sottile, F.: Algorithm 921: alphacertified: certifying solutions to polynomial systems. ACM Transactions on Mathematical Software (TOMS) 38(4), 28 (2012)","journal-title":"ACM Transactions on Mathematical Software (TOMS)"},{"key":"1045_CR14","first-page":"458","volume":"32","author":"C Hermite","year":"1851","unstructured":"Hermite, C.: Sur les fonctions alg\u00e9briques. CR Acad. Sci.(Paris) 32, 458\u2013461 (1851)","journal-title":"CR Acad. Sci.(Paris)"},{"issue":"212","key":"1045_CR15","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":"1","key":"1045_CR16","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1023\/A:1019163811284","volume":"18","author":"B Huber","year":"1998","unstructured":"Huber, B., Verschelde, J.: Polyhedral end games for polynomial continuation. Numer. Algorithms 18(1), 91\u2013108 (1998)","journal-title":"Numer. Algorithms"},{"issue":"3","key":"1045_CR17","first-page":"82","volume":"10","author":"AG Ku\u0161nirenko","year":"1976","unstructured":"Ku\u0161nirenko, A. G.: Newton polyhedra and Bezout\u2019s theorem. Funkcional. Anal. i Prilo\u017een 10(3), 82\u201383 (1976)","journal-title":"Funkcional. Anal. i Prilo\u017een"},{"issue":"5","key":"1045_CR18","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1137\/0726069","volume":"26","author":"TY Li","year":"1989","unstructured":"Li, T. Y., Sauer, T., Yorke, J. A.: The cheater\u2019s homotopy: an efficient procedure for solving systems of polynomial equations. SIAM J. Numer. Anal. 26(5), 1241\u20131251 (1989)","journal-title":"SIAM J. Numer. Anal."},{"key":"1045_CR19","doi-asserted-by":"crossref","unstructured":"Mart\u00edn del Campo-Sanchez, A., Sottile, F., Williams, R.: Classification of Schubert Galois groups in Gr(4, 9), arXiv:1902.06809 (2019)","DOI":"10.1007\/s40598-022-00221-2"},{"key":"1045_CR20","volume-title":"Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems","author":"AP Morgan","year":"1987","unstructured":"Morgan, A. P.: Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems. Prentice Hall Inc., Englewood Cliffs (1987)"},{"issue":"2","key":"1045_CR21","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0096-3003(89)90099-4","volume":"29","author":"AP Morgan","year":"1989","unstructured":"Morgan, A.P., Sommese, A.J.: Coefficient-parameter polynomial continuation. Appl. Math. Comput. 29(2), 123\u2013160 (1989). part II","journal-title":"Appl. Math. Comput."},{"key":"1045_CR22","volume-title":"Topology: a First Course","author":"JR Munkres","year":"1975","unstructured":"Munkres, J. R.: Topology: a First Course. Prentice-Hall Inc., Englewood Cliffs (1975)"},{"issue":"4","key":"1045_CR23","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1090\/S1056-3911-05-00408-X","volume":"14","author":"GP Pirola","year":"2005","unstructured":"Pirola, G. P., Schlesinger, E.: Monodromy of projective curves. J. Algebraic Geom. 14(4), 623\u2013642 (2005)","journal-title":"J. Algebraic Geom."},{"key":"1045_CR24","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-1-4612-4984-9_13","volume-title":"Newton\u2019s Method Estimates from Data at One Point. The Merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics","author":"S Smale","year":"1986","unstructured":"Smale, S.: Newton\u2019s Method Estimates from Data at One Point. The Merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics, pp 185\u2013196. Springer, New York (1986)"},{"key":"1045_CR25","doi-asserted-by":"publisher","DOI":"10.1142\/5763","volume-title":"The Numerical Solution of Systems of Polynomials","author":"AJ Sommese","year":"2005","unstructured":"Sommese, A. J., Wampler II, C. W.: The Numerical Solution of Systems of Polynomials. World Scientific Publishing Co. Pte. Ltd., Hackensack (2005)"},{"key":"1045_CR26","unstructured":"Sottile, F., Williams, R., Ying, L.: Galois groups of compositions of Schubert problems. arXiv:1910.06843 (2019)"},{"issue":"2","key":"1045_CR27","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.comgeo.2009.04.004","volume":"43","author":"R Steffens","year":"2010","unstructured":"Steffens, R., Theobald, T.: Mixed volume techniques for embeddings of Laman graphs. Comput. Geom. 43(2), 84\u201393 (2010)","journal-title":"Comput. Geom."},{"issue":"2","key":"1045_CR28","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/317275.317286","volume":"25","author":"J Verschelde","year":"1999","unstructured":"Verschelde, J.: Algorithm 795: PHCpack: A general-purpose solver for polynomial systems by homotopy continuation. ACM Trans. Math. Softw. 25(2), 251\u2013276 (1999). Available at http:\/\/www.math.uic.edu\/~jan","journal-title":"ACM Trans. Math. Softw."},{"key":"1045_CR29","volume-title":"Finite Permutation Groups. Translated from the German by R. Bercov","author":"H Wielandt","year":"1964","unstructured":"Wielandt, H.: Finite Permutation Groups. Translated from the German by R. Bercov. Academic Press, New York-London (1964)"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-01045-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-020-01045-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-01045-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,17]],"date-time":"2023-10-17T08:37:21Z","timestamp":1697531841000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-020-01045-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,10]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["1045"],"URL":"https:\/\/doi.org\/10.1007\/s11075-020-01045-x","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,10]]},"assertion":[{"value":"28 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}