Complexity of solving systems with few independent monomials and applications to mass-action kinetics

Abstract

We design an algorithm for finding solutions with nonzero coordinates of systems of polynomial equations which has a better complexity bound than for known algorithms when a system contains a few linearly independent monomials. For parametric binomial systems we construct an algorithm of polynomial complexity. We discuss the applications of these algorithms in the context of chemical reaction systems.