Complexity of Solving Systems with Few Independent Monomials and Applications to Mass-Action Kinetics

DOI10.1007/978-3-642-32973-9_12zbMath1373.68461OpenAlexW174846545MaRDI QIDQ2914994

Andreas Weber, Dima Yu. Grigoriev

Publication date: 21 September 2012

Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32973-9_12

zbMATH Keywords

Smith formchemical reaction networksmass-action kineticstoric systemscomplexity of solving systems of polynomial equations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Classical flows, reactions, etc. in chemistry (92E20) Chemical kinetics in thermodynamics and heat transfer (80A30)

Related Items (6)

Testing binomiality of chemical reaction networks using comprehensive Gröbner systems ⋮ Model Reduction of Biochemical Reactions Networks by Tropical Analysis Methods ⋮ PoCaB: A Software Infrastructure to Explore Algebraic Methods for Bio-chemical Reaction Networks ⋮ Systems of equations with a single solution ⋮ Efficiently and effectively recognizing toricity of steady state varieties ⋮ Which Small Reaction Networks Are Multistationary?

Uses Software

• PoCaB

This page was built for publication: Complexity of Solving Systems with Few Independent Monomials and Applications to Mass-Action Kinetics