{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T13:47:16Z","timestamp":1762782436311},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,7,21]],"date-time":"2020-07-21T00:00:00Z","timestamp":1595289600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,7,21]],"date-time":"2020-07-21T00:00:00Z","timestamp":1595289600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Max Planck Institute for Informatics"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2021,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider the problem of testing whether the points in a complex or real variety with non-zero coordinates form a multiplicative group or, more generally, a coset of a multiplicative group. For the coset case, we study the notion of shifted toric varieties which generalizes the notion of toric varieties. This requires a geometric view on the varieties rather than an algebraic view on the ideals. We present algorithms and computations on 129 models from the BioModels repository testing for group and coset structures over both the complex numbers and the real numbers. Our methods over the complex numbers are based on Gr\u00f6bner basis techniques and binomiality tests. Over the real numbers we use first-order characterizations and employ real quantifier elimination. In combination with suitable prime decompositions and restrictions to subspaces it turns out that almost all models show coset structure. Beyond our practical computations, we give upper bounds on the asymptotic worst-case complexity of the corresponding problems by proposing single exponential algorithms that test complex or real varieties for toricity or shifted toricity. In the positive case, these algorithms produce generating binomials. In addition, we propose an asymptotically fast algorithm for testing membership in a binomial variety over the algebraic closure of the rational numbers.<\/jats:p>","DOI":"10.1007\/s11786-020-00479-9","type":"journal-article","created":{"date-parts":[[2020,7,21]],"date-time":"2020-07-21T09:02:48Z","timestamp":1595322168000},"page":"199-232","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Efficiently and Effectively Recognizing Toricity of Steady State Varieties"],"prefix":"10.1007","volume":"15","author":[{"given":"Dima","family":"Grigoriev","sequence":"first","affiliation":[]},{"given":"Alexandru","family":"Iosif","sequence":"additional","affiliation":[]},{"given":"Hamid","family":"Rahkooy","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Sturm","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Weber","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,21]]},"reference":[{"key":"479_CR1","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-319-42547-4_3","volume-title":"Intelligent Computer Mathematics. CICM 2016","author":"E \u00c1brah\u00e1m","year":"2016","unstructured":"\u00c1brah\u00e1m, E., Abbott, J., Becker, B., Bigatti, A.M., Brain, M., Buchberger, B., Cimatti, A., Davenport, J.H., England, M., Fontaine, P., Forrest, S., Griggio, A., Kroening, D., Seiler, W.M., Sturm, T.: SC2: satisfiability checking meets symbolic computation. In: Kohlhase, M., Johansson, M., Miller, B., de Moura, L., Tompa, F. (eds.) Intelligent Computer Mathematics. CICM 2016. LNCS, vol. 9791, pp. 28\u201343. Springer, Berlin (2016). https:\/\/doi.org\/10.1007\/978-3-319-42547-4_3"},{"key":"479_CR2","series-title":"Algorithms and Computation in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-33099-2","volume-title":"Algorithms in Real Algebraic Geometry","author":"S Basu","year":"2006","unstructured":"Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Algorithms and Computation in Mathematics, vol. 10. Springer, Berlin (2006). https:\/\/doi.org\/10.1007\/3-540-33099-2"},{"key":"479_CR3","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0913-3","volume-title":"Gr\u00f6bner Bases: A Computational Approach to Commutative Algebra","author":"T Becker","year":"1993","unstructured":"Becker, T., Weispfenning, V., Kredel, H.: Gr\u00f6bner Bases: A Computational Approach to Commutative Algebra. Graduate Texts in Mathematics, vol. 141. Springer, Berlin (1993). https:\/\/doi.org\/10.1007\/978-1-4612-0913-3"},{"key":"479_CR4","doi-asserted-by":"publisher","DOI":"10.1525\/9780520327474","volume-title":"Lectures on Gas Theory","author":"L Boltzmann","year":"1964","unstructured":"Boltzmann, L.: Lectures on Gas Theory. University of California Press, Berkeley (1964)"},{"issue":"3","key":"479_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/3313880.3313885","volume":"52","author":"F Boulier","year":"2018","unstructured":"Boulier, F., Fages, F., Radulescu, O., Samal, S.S., Schuppert, A., Seiler, W., Sturm, T., Walcher, S., Weber, A.: The SYMBIONT project: symbolic methods for biological networks. ACM Commun. Comput. Algebra 52(3), 67\u201370 (2018). https:\/\/doi.org\/10.1145\/3313880.3313885","journal-title":"ACM Commun. Comput. Algebra"},{"key":"479_CR6","doi-asserted-by":"publisher","DOI":"10.7490\/f1000research.1115995.1","author":"F Boulier","year":"2018","unstructured":"Boulier, F., Fages, F., Radulescu, O., Samal, S.S., Schuppert, A., Seiler, W., Sturm, T., Walcher, S., Weber, A.: The SYMBIONT project: symbolic methods for biological networks. F1000Research (2018). https:\/\/doi.org\/10.7490\/f1000research.1115995.1","journal-title":"F1000Research"},{"key":"479_CR7","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.jsc.2019.07.008","volume":"98","author":"RJ Bradford","year":"2019","unstructured":"Bradford, R.J., Davenport, J.H., England, M., Errami, H., Gerdt, V.P., Grigoriev, D., Hoyt, C., Ko\u0161ta, M., Radulescu, O., Sturm, T., Weber, A.: Identifying the parametric occurrence of multiple steady states for some biological networks. J. Symb. Comput. 98, 84\u2013119 (2019). https:\/\/doi.org\/10.1016\/j.jsc.2019.07.008","journal-title":"J. Symb. Comput."},{"key":"479_CR8","unstructured":"Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Doctoral dissertation, Mathematical Institute, University of Innsbruck, Austria (1965)"},{"issue":"D1","key":"479_CR9","doi-asserted-by":"publisher","first-page":"D542","DOI":"10.1093\/nar\/gku1181","volume":"43","author":"V Chelliah","year":"2015","unstructured":"Chelliah, V., Juty, N., Ajmera, I., Ali, R., Dumousseau, M., Glont, M., Hucka, M., Jalowicki, G., Keating, S., Knight-Schrijver, V., Lloret-Villas, A., NathNatarajan, K., Pettit, J.-B., Rodriguez, N., Schubert, M., Wimalaratne, S.M., Zhao, Y., Hermjakob, H., Le Nov\u00e8re, N., Laibe, C.: BioModels: ten-year anniversary. Nucl. Acids Res. 43(D1), D542\u2013D548 (2015). https:\/\/doi.org\/10.1093\/nar\/gku1181","journal-title":"Nucl. Acids Res."},{"issue":"4","key":"479_CR10","doi-asserted-by":"publisher","first-page":"1838","DOI":"10.1007\/BF01095643","volume":"34","author":"AL Chistov","year":"1986","unstructured":"Chistov, A.L.: Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time. J. Sov. Math. 34(4), 1838\u20131882 (1986). https:\/\/doi.org\/10.1007\/BF01095643","journal-title":"J. Sov. Math."},{"key":"479_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BFb0030287","volume-title":"MFCS 1984: Mathematical Foundations of Computer Science","author":"AL Chistov","year":"1984","unstructured":"Chistov, A.L., Grigor\u2019ev, D.Y.: Complexity of quantifier elimination in the theory of algebraically closed fields. In: Chytil, M.P., Koubek, V. (eds.) MFCS 1984: Mathematical Foundations of Computer Science. LNCS, vol. 176, pp. 17\u201331. Springer, Berlin (1984). https:\/\/doi.org\/10.1007\/BFb0030287"},{"key":"479_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-07407-4_17","volume-title":"Automata Theory and Formal Languages. 2nd GI Conference","author":"GE Collins","year":"1975","unstructured":"Collins, G.E.: Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition. In: Brakhage, H. (ed.) Automata Theory and Formal Languages. 2nd GI Conference. LNCS, vol. 33, pp. 134\u2013183. Springer, Berlin (1975). https:\/\/doi.org\/10.1007\/3-540-07407-4_17"},{"issue":"3","key":"479_CR13","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0747-7171(08)80152-6","volume":"12","author":"GE Collins","year":"1991","unstructured":"Collins, G.E., Hong, H.: Partial cylindrical algebraic decomposition for quantifier elimination. J. Symb. Comput. 12(3), 299\u2013328 (1991). https:\/\/doi.org\/10.1016\/S0747-7171(08)80152-6","journal-title":"J. Symb. Comput."},{"issue":"10","key":"479_CR14","doi-asserted-by":"publisher","first-page":"4174","DOI":"10.1007\/s11538-019-00639-4","volume":"81","author":"C Conradi","year":"2019","unstructured":"Conradi, C., Iosif, A., Kahle, T.: Multistationarity in the space of total concentrations for systems that admit a monomial parametrization. Bull. Math. Biol. 81(10), 4174\u20134209 (2019). https:\/\/doi.org\/10.1007\/s11538-019-00639-4","journal-title":"Bull. Math. Biol."},{"key":"479_CR15","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.aam.2015.08.004","volume":"71","author":"C Conradi","year":"2015","unstructured":"Conradi, C., Kahle, T.: Detecting binomiality. Adv. Appl. Math. 71, 52\u201367 (2015). https:\/\/doi.org\/10.1016\/j.aam.2015.08.004","journal-title":"Adv. Appl. Math."},{"key":"479_CR16","series-title":"Undergraduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2181-2","volume-title":"Ideals, Varieties and Algorithms","author":"D Cox","year":"1992","unstructured":"Cox, D., Little, J., O\u2019Shea, D.: Ideals, Varieties and Algorithms. Undergraduate Texts in Mathematics. Springer, Berlin (1992). https:\/\/doi.org\/10.1007\/978-1-4757-2181-2"},{"issue":"11","key":"479_CR17","doi-asserted-by":"publisher","first-page":"1551","DOI":"10.1016\/j.jsc.2008.08.006","volume":"44","author":"G Craciun","year":"2009","unstructured":"Craciun, G., Dickenstein, A., Shiu, A., Sturmfels, B.: Toric dynamical systems. J. Symb. Comput. 44(11), 1551\u20131565 (2009). https:\/\/doi.org\/10.1016\/j.jsc.2008.08.006","journal-title":"J. Symb. Comput."},{"issue":"1\u20132","key":"479_CR18","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0747-7171(88)80004-X","volume":"5","author":"JH Davenport","year":"1988","unstructured":"Davenport, J.H., Heintz, J.: Real quantifier elimination is doubly exponential. J. Symb. Comput. 5(1\u20132), 29\u201335 (1988). https:\/\/doi.org\/10.1016\/S0747-7171(88)80004-X","journal-title":"J. Symb. Comput."},{"key":"479_CR19","doi-asserted-by":"publisher","unstructured":"Dolzmann, A., Seidl, A., Sturm, T.: Efficient projection orders for CAD. In: Gutierrez, J. (ed.) ISSAC 2004: Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, pp. 111\u2013118. ACM, New York, NY (2004). |https:\/\/doi.org\/10.1145\/1005285.1005303","DOI":"10.1145\/1005285.1005303"},{"issue":"2","key":"479_CR20","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/261320.261324","volume":"31","author":"A Dolzmann","year":"1997","unstructured":"Dolzmann, A., Sturm, T.: Redlog: computer algebra meets computer logic. ACM SIGSAM Bull. 31(2), 2\u20139 (1997). https:\/\/doi.org\/10.1145\/261320.261324","journal-title":"ACM SIGSAM Bull."},{"issue":"2","key":"479_CR21","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1006\/jsco.1997.0123","volume":"24","author":"A Dolzmann","year":"1997","unstructured":"Dolzmann, A., Sturm, T.: Simplification of quantifier-free formulae over ordered fields. J. Symb. Comput. 24(2), 209\u2013231 (1997). https:\/\/doi.org\/10.1006\/jsco.1997.0123","journal-title":"J. Symb. Comput."},{"issue":"1\u20132","key":"479_CR22","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/jsco.2001.0451","volume":"32","author":"J-G Dumas","year":"2001","unstructured":"Dumas, J.-G., Saunders, B.D., Villard, G.: On efficient sparse integer matrix Smith normal form computations. J. Symb. Comput. 32(1\u20132), 71\u201399 (2001). https:\/\/doi.org\/10.1006\/jsco.2001.0451","journal-title":"J. Symb. Comput."},{"key":"479_CR23","first-page":"318","volume":"18","author":"A Einstein","year":"1916","unstructured":"Einstein, A.: Strahlungs-emission und -absorption nach der Quantentheorie. Verh. Dtsch. Phys. Ges. 18, 318\u2013323 (1916)","journal-title":"Verh. Dtsch. Phys. Ges."},{"issue":"1","key":"479_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10463-010-0290-9","volume":"84","author":"D Eisenbud","year":"1996","unstructured":"Eisenbud, D., Sturmfels, B.: Binomial ideals. Duke Math. J. 84(1), 1\u201345 (1996). https:\/\/doi.org\/10.1007\/s10463-010-0290-9","journal-title":"Duke Math. J."},{"issue":"1\u20133","key":"479_CR25","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/780506.780516","volume":"139","author":"J-C Faug\u00e8re","year":"1999","unstructured":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing Gr\u00f6bner bases (F4). J. Pure Appl. Algebra 139(1\u20133), 61\u201388 (1999). https:\/\/doi.org\/10.1145\/780506.780516","journal-title":"J. Pure Appl. Algebra"},{"key":"479_CR26","doi-asserted-by":"publisher","unstructured":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing gr\u00f6bner bases without reduction to zero (F5). In: Mora, T. (ed.) ISSAC 2002: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, pp 75\u201383. ACM, New York, NY (2002) https:\/\/doi.org\/10.1145\/780506.780516","DOI":"10.1145\/780506.780516"},{"issue":"3","key":"479_CR27","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF00255665","volume":"49","author":"M Feinberg","year":"1972","unstructured":"Feinberg, M.: Complex balancing in general kinetic systems. Arch. Ration. Mech. Anal. 49(3), 187\u2013194 (1972). https:\/\/doi.org\/10.1007\/BF00255665","journal-title":"Arch. Ration. Mech. Anal."},{"issue":"10","key":"479_CR28","doi-asserted-by":"publisher","first-page":"2229","DOI":"10.1016\/0009-2509(87)80099-4","volume":"42","author":"M Feinberg","year":"1987","unstructured":"Feinberg, M.: Stability of complex isothermal reactors\u2014I. The deficiency zero and deficiency one theorems. Chem. Eng. Sci. 42(10), 2229\u20132268 (1987). https:\/\/doi.org\/10.1016\/0009-2509(87)80099-4","journal-title":"Chem. Eng. Sci."},{"key":"479_CR29","series-title":"Applied Mathematical Sciences","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03858-8","volume-title":"Foundations of Chemical Reaction Network Theory","author":"M Feinberg","year":"2019","unstructured":"Feinberg, M.: Foundations of Chemical Reaction Network Theory. Applied Mathematical Sciences, vol. 202. Springer, Berlin (2019). https:\/\/doi.org\/10.1007\/978-3-030-03858-8"},{"issue":"6","key":"479_CR30","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1042\/bst0311472","volume":"31","author":"A Finney","year":"2003","unstructured":"Finney, A., Hucka, M.: Systems biology markup language: level 2 and beyond. Biochem. Soc. Trans. 31(6), 1472\u20131473 (2003). https:\/\/doi.org\/10.1042\/bst0311472","journal-title":"Biochem. Soc. Trans."},{"issue":"5","key":"479_CR31","first-page":"1067","volume":"229","author":"MA Frumkin","year":"1976","unstructured":"Frumkin, M.A.: An application of modular arithmetic to the construction of algorithms for solving systems of linear equations. Dokl. Akad. Nauk SSSR 229(5), 1067\u20131070 (1976)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"479_CR32","series-title":"Annals of Mathematics Studies","doi-asserted-by":"publisher","DOI":"10.1515\/9781400882526","volume-title":"Introduction to Toric Varieties","author":"W Fulton","year":"1993","unstructured":"Fulton, W.: Introduction to Toric Varieties. Annals of Mathematics Studies, vol. 131. Princeton University Press, Princeton, NJ (1993). https:\/\/doi.org\/10.1515\/9781400882526"},{"key":"479_CR33","series-title":"Contemporary Mathematics","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1090\/conm\/286\/04754","volume-title":"Symbolic Computation: Solving Equations in Algebra, Geometry, and Engineering","author":"K Gatermann","year":"2001","unstructured":"Gatermann, K.: Counting stable solutions of sparse polynomial systems in chemistry. In: Green, E.L., Ho\u015ften, S., Laubenbacher, R.C., Powers, V.A. (eds.) Symbolic Computation: Solving Equations in Algebra, Geometry, and Engineering. Contemporary Mathematics, vol. 286, pp. 53\u201369. AMS, Providence, RI (2001). https:\/\/doi.org\/10.1090\/conm\/286\/04754"},{"issue":"2","key":"479_CR34","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.aam.2004.04.003","volume":"34","author":"K Gatermann","year":"2005","unstructured":"Gatermann, K., Wolfrum, M.: Bernstein\u2019s second theorem and Viro\u2019s method for sparse polynomial systems in chemistry. Adv. Appl. Math. 34(2), 252\u2013294 (2005). https:\/\/doi.org\/10.1016\/j.aam.2004.04.003","journal-title":"Adv. Appl. Math."},{"issue":"6","key":"479_CR35","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1016\/j.physa.2012.10.009","volume":"392","author":"AN Gorban","year":"2013","unstructured":"Gorban, A.N., Mirkes, E.M., Yablonski, G.S.: Thermodynamics in the limit of irreversible reactions. Physica A 392(6), 1318\u20131335 (2013). https:\/\/doi.org\/10.1016\/j.physa.2012.10.009","journal-title":"Physica A"},{"issue":"21","key":"479_CR36","doi-asserted-by":"publisher","first-page":"5388","DOI":"10.1016\/j.ces.2011.07.054","volume":"66","author":"AN Gorban","year":"2011","unstructured":"Gorban, A.N., Yablonski, G.S.: Extended detailed balance for systems with irreversible reactions. Chem. Eng. Sci. 66(21), 5388\u20135399 (2011). https:\/\/doi.org\/10.1016\/j.ces.2011.07.054","journal-title":"Chem. Eng. Sci."},{"issue":"4","key":"479_CR37","doi-asserted-by":"publisher","first-page":"1762","DOI":"10.1007\/BF01095638","volume":"34","author":"DY Grigor\u2019ev","year":"1986","unstructured":"Grigor\u2019ev, D.Y.: Factorization of polynomials over a finite field and the solution of systems of algebraic equations. J. Sov. Math. 34(4), 1762\u20131803 (1986). https:\/\/doi.org\/10.1007\/BF01095638","journal-title":"J. Sov. Math."},{"issue":"1\u20132","key":"479_CR38","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0747-7171(88)80006-3","volume":"5","author":"DY Grigor\u2019ev","year":"1988","unstructured":"Grigor\u2019ev, D.Y.: Complexity of deciding Tarski algebra. J. Symb. Comput. 5(1\u20132), 65\u2013108 (1988). https:\/\/doi.org\/10.1016\/S0747-7171(88)80006-3","journal-title":"J. Symb. Comput."},{"issue":"1\u20132","key":"479_CR39","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0747-7171(88)80005-1","volume":"5","author":"DY Grigor\u2019ev","year":"1988","unstructured":"Grigor\u2019ev, D.Y., Vorobjov, N.N.: Solving systems of polynomial inequalities in subexponential time. J. Symb. Comput. 5(1\u20132), 37\u201364 (1988). https:\/\/doi.org\/10.1016\/S0747-7171(88)80005-1","journal-title":"J. Symb. Comput."},{"issue":"6","key":"479_CR40","doi-asserted-by":"publisher","first-page":"3389","DOI":"10.1016\/j.aim.2012.08.009","volume":"231","author":"D Grigoriev","year":"2012","unstructured":"Grigoriev, D., Milman, P.D.: Nash resolution for binomial varieties as Euclidean division. A priori termination bound, polynomial complexity in essential dimension 2. Adv. Math. 231(6), 3389\u20133428 (2012). https:\/\/doi.org\/10.1016\/j.aim.2012.08.009","journal-title":"Adv. Math."},{"key":"479_CR41","doi-asserted-by":"publisher","unstructured":"Grigoriev, D., Weber, A.: Complexity of solving systems with few independent monomials and applications to mass-action kinetics. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds.), Computer Algebra in Scientific Computing: 14th International Workshop, CASC 2012. Maribor, Slovenia, September 3\u20136, 2012. Proceedings, LNCS, vol. 7442, pp. 143\u2013154. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-32973-9_12","DOI":"10.1007\/978-3-642-32973-9_12"},{"issue":"6","key":"479_CR42","first-page":"50","volume":"1","author":"AC Hearn","year":"1967","unstructured":"Hearn, A.C.: Reduce\u2014a user-oriented system for algebraic simplification. ACM SIGSAM Bull. 1(6), 50\u201351 (1967)","journal-title":"ACM SIGSAM Bull."},{"key":"479_CR43","unstructured":"Hearn, A.C.: Reduce: the first forty years. In: Dolzmann, A., Seidl, A., Sturm, T. (eds.) Algorithmic Algebra and Logic: Proceedings of the A3L 2005, April 3\u20136, Passau, Germany. Books on Demand, Norderstedt, Germany (2005)"},{"issue":"2","key":"479_CR44","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF00251225","volume":"47","author":"F Horn","year":"1972","unstructured":"Horn, F., Jackson, R.: General mass action kinetics. Arch. Ration. Mech. Anal. 47(2), 81\u2013116 (1972). https:\/\/doi.org\/10.1007\/BF00251225","journal-title":"Arch. Ration. Mech. Anal."},{"issue":"4","key":"479_CR45","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1093\/bioinformatics\/btg015","volume":"19","author":"M Hucka","year":"2003","unstructured":"Hucka, M., Finney, A., Sauro, H.M., Bolouri, H., Doyle, J.C., Kitano, H., Arkin, A.P., Bornstein, B.J., Bray, D., Cornish-Bowden, A., Cuellar, A.A., Dronov, S., Gilles, E.D., Ginkel, M., Gor, V., Goryanin, I.I., Hedley, W.J., Hodgman, T.C., Hofmeyr, J.-H., Hunter, P.J., Juty, N.S., Kasberger, J.L., Kremling, A., Kummer, U., Le Nov\u00e8re, N., Loew, L.M., Lucio, D., Mendes, P., Minch, E., Mjolsness, E.D., Nakayama, Y., Nelson, M.R., Nielsen, P.F., Sakurada, T., Schaff, J.C., Shapiro, B.E., Shimizu, T.S., Spence, H.D., Stelling, J., Takahashi, K., Tomita, M., Wagner, J., Wang, J.: The systems biology markup language (SBML): a medium for representation and exchange of biochemical network models. Bioinformatics 19(4), 524\u2013531 (2003). https:\/\/doi.org\/10.1093\/bioinformatics\/btg015","journal-title":"Bioinformatics"},{"issue":"4","key":"479_CR46","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s10463-010-0290-9","volume":"62","author":"T Kahle","year":"2010","unstructured":"Kahle, T.: Decompositions of binomial ideals. Ann. Inst. Stat. Math. 62(4), 727\u2013745 (2010). https:\/\/doi.org\/10.1007\/s10463-010-0290-9","journal-title":"Ann. Inst. Stat. Math."},{"issue":"1","key":"479_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10463-010-0290-9","volume":"4","author":"T Kahle","year":"2012","unstructured":"Kahle, T.: Decompositions of binomial ideals. J. Softw. Algebra Geom. 4(1), 1\u20135 (2012). https:\/\/doi.org\/10.1007\/s10463-010-0290-9","journal-title":"J. Softw. Algebra Geom."},{"key":"479_CR48","unstructured":"Ko\u0161ta, M.: New concepts for real quantifier elimination by virtual substitution. Doctoral dissertation, Saarland University, Germany (2016)"},{"key":"479_CR49","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.jsc.2015.07.002","volume":"74","author":"M Ko\u0161ta","year":"2016","unstructured":"Ko\u0161ta, M., Sturm, T., Dolzmann, A.: Better answers to real questions. J. Symb. Comput. 74, 255\u2013275 (2016). https:\/\/doi.org\/10.1016\/j.jsc.2015.07.002","journal-title":"J. Symb. Comput."},{"issue":"3","key":"479_CR50","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0001-8708(82)90048-2","volume":"46","author":"EW Mayr","year":"1982","unstructured":"Mayr, E.W., Meyer, A.R.: The complexity of the word problems for commutative semigroups and polynomial ideals. Adv. Math. 46(3), 305\u2013329 (1982). https:\/\/doi.org\/10.1016\/0001-8708(82)90048-2","journal-title":"Adv. Math."},{"issue":"1","key":"479_CR51","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10208-014-9239-3","volume":"16","author":"S M\u00fcller","year":"2016","unstructured":"M\u00fcller, S., Feliu, E., Regensburger, G., Conradi, C., Shiu, A., Dickenstein, A.: Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry. Found. Comput. Math. 16(1), 69\u201397 (2016). https:\/\/doi.org\/10.1007\/s10208-014-9239-3","journal-title":"Found. Comput. Math."},{"issue":"6","key":"479_CR52","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1145\/1217856.1217859","volume":"53","author":"R Nieuwenhuis","year":"2006","unstructured":"Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: from an abstract Davis\u2013Putnam\u2013Logemann\u2013Loveland procedure to DPLL(T). J. ACM 53(6), 937\u2013977 (2006). https:\/\/doi.org\/10.1145\/1217856.1217859","journal-title":"J. ACM"},{"issue":"4","key":"479_CR53","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1103\/PhysRev.37.405","volume":"37","author":"L Onsager","year":"1931","unstructured":"Onsager, L.: Reciprocal relations in irreversible processes. I. Phys. Rev. 37(4), 405 (1931). https:\/\/doi.org\/10.1103\/PhysRev.37.405","journal-title":"Phys. Rev."},{"issue":"2","key":"479_CR54","doi-asserted-by":"publisher","first-page":"1650","DOI":"10.1137\/17M1113722","volume":"17","author":"M P\u00e9rezMill\u00e1n","year":"2018","unstructured":"P\u00e9rezMill\u00e1n, M., Dickenstein, A.: The structure of MESSI biological systems. SIAM J. Appl. Dyn. Syst. 17(2), 1650\u20131682 (2018). https:\/\/doi.org\/10.1137\/17M1113722","journal-title":"SIAM J. Appl. Dyn. Syst."},{"issue":"5","key":"479_CR55","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1007\/s11538-011-9685-x","volume":"74","author":"M P\u00e9rez Mill\u00e1n","year":"2012","unstructured":"P\u00e9rez Mill\u00e1n, M., Dickenstein, A., Shiu, A., Conradi, C.: Chemical reaction systems with toric steady states. Bull. Math. Biol. 74(5), 1027\u20131065 (2012). https:\/\/doi.org\/10.1007\/s11538-011-9685-x","journal-title":"Bull. Math. Biol."},{"key":"479_CR56","unstructured":"Seidl, A.: Cylindrical decomposition under application-oriented paradigms. Doctoral dissertation, University of Passau, Germany (2006)"},{"key":"479_CR57","unstructured":"Seidl, A.M., Sturm, T.: Boolean quantification in a first-order context. In: V.G. Ganzha, E.W. Mayr, E.V. Vorozhtsov (eds.) Proceedings of the 6th International Workshop on Computer Algebra in Scientific Computing, CASC 2003, pp. 329\u2013345. Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, Garching, Germany (2003)"},{"key":"479_CR58","series-title":"Grundlehren der mathematischen Wissenschaften","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-96200-4","volume-title":"Basic Algebraic Geometry","author":"IR Shafarevich","year":"1974","unstructured":"Shafarevich, I.R.: Basic Algebraic Geometry. Grundlehren der mathematischen Wissenschaften, vol. 213. Springer, Berlin (1974). https:\/\/doi.org\/10.1007\/978-3-642-96200-4"},{"key":"479_CR59","unstructured":"Sturm, T.: Real quantifier elimination in geometry. Doctoral dissertation, University of Passau, Germany (1999)"},{"key":"479_CR60","doi-asserted-by":"publisher","unstructured":"Sturm, T.: New domains for applied quantifier elimination. In: V.G. Ganzha, E.W. Mayr, E.V. Vorozhtsov (eds.) Computer Algebra in Scientific Computing: 9th International Workshop, CASC 2006, Chisinau, Moldova, September 11\u201315, 2006. Proceedings, LNCS, vol. 194, pp. 295\u2013301. Springer (2006). https:\/\/doi.org\/10.1007\/11870814_25","DOI":"10.1007\/11870814_25"},{"issue":"2","key":"479_CR61","first-page":"177","volume":"67","author":"T Sturm","year":"2007","unstructured":"Sturm, T.: REDLOG online resources for applied quantifier elimination. Acta Acad. Ab. 67(2), 177\u2013191 (2007)","journal-title":"Acta Acad. Ab."},{"issue":"3\u20134","key":"479_CR62","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s11786-017-0319-z","volume":"11","author":"T Sturm","year":"2017","unstructured":"Sturm, T.: A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications. Math. Comput. Sci. 11(3\u20134), 483\u2013502 (2017). https:\/\/doi.org\/10.1007\/s11786-017-0319-z","journal-title":"Math. Comput. Sci."},{"key":"479_CR63","series-title":"University Lecture Series","doi-asserted-by":"publisher","DOI":"10.1090\/ulect\/008","volume-title":"Gr\u00f6bner Bases and Convex Polytopes","author":"B Sturmfels","year":"1996","unstructured":"Sturmfels, B.: Gr\u00f6bner Bases and Convex Polytopes. University Lecture Series, vol. 8. AMS, Providence, RI (1996). https:\/\/doi.org\/10.1090\/ulect\/008"},{"issue":"1","key":"479_CR64","first-page":"42","volume":"36","author":"O Tange","year":"2011","unstructured":"Tange, O.: GNU parallel: the command-line power tool. login USENIX Mag. 36(1), 42\u201347 (2011)","journal-title":"login USENIX Mag."},{"key":"479_CR65","unstructured":"Tarski, A.: Decision method for elementary algebra and geometry. Prepared for publication by J. C. C. McKinsey. RAND Report R109, August 1, 1948: Revised May 1951, 2nd edn. RAND, Santa Monica, CA, 1957"},{"issue":"1","key":"479_CR66","doi-asserted-by":"publisher","first-page":"e1004012","DOI":"10.1371\/journal.pcbi.1004012","volume":"11","author":"EO Voit","year":"2015","unstructured":"Voit, E.O., Martens, H.A., Omholt, S.W.: 150 years of the mass action law. PLoS Comput. Biol. 11(1), e1004012 (2015). https:\/\/doi.org\/10.1371\/journal.pcbi.1004012","journal-title":"PLoS Comput. Biol."},{"issue":"12","key":"479_CR67","doi-asserted-by":"publisher","first-page":"e1007311","DOI":"10.1371\/journal.pcbi.1007311","volume":"15","author":"S Wang","year":"2019","unstructured":"Wang, S., Lin, J.-R., Sontag, E.D., Sorger, P.K.: Inferring reaction network structure from single-cell, multiplex data, using toric systems theory. PLoS Comput. Biol. 15(12), e1007311 (2019). https:\/\/doi.org\/10.1371\/journal.pcbi.1007311","journal-title":"PLoS Comput. Biol."},{"issue":"8","key":"479_CR68","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/BF01517498","volume":"22","author":"R Wegscheider","year":"1901","unstructured":"Wegscheider, R.: \u00dcber simultane Gleichgewichte und die Beziehungen zwischen Thermodynamik und Reactionskinetik homogener Systeme. Monatsh. Chem. Verw. Tl. 22(8), 849\u2013906 (1901). https:\/\/doi.org\/10.1007\/BF01517498","journal-title":"Monatsh. Chem. Verw. Tl."},{"issue":"1\u20132","key":"479_CR69","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0747-7171(88)80003-8","volume":"5","author":"V Weispfenning","year":"1988","unstructured":"Weispfenning, V.: The complexity of linear problems in fields. J. Symb. Comput. 5(1\u20132), 3\u201327 (1988). https:\/\/doi.org\/10.1016\/S0747-7171(88)80003-8","journal-title":"J. Symb. Comput."},{"issue":"2","key":"479_CR70","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s002000050055","volume":"8","author":"V Weispfenning","year":"1997","unstructured":"Weispfenning, V.: Quantifier elimination for real algebra\u2014the quadratic case and beyond. Appl. Algebra Eng. Commun. 8(2), 85\u2013101 (1997). https:\/\/doi.org\/10.1007\/s002000050055","journal-title":"Appl. Algebra Eng. Commun."}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-020-00479-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11786-020-00479-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-020-00479-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T23:06:45Z","timestamp":1626822405000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11786-020-00479-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,21]]},"references-count":70,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["479"],"URL":"https:\/\/doi.org\/10.1007\/s11786-020-00479-9","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,21]]},"assertion":[{"value":"8 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}