On the complexity of quadratization for polynomial differential equations

DOI10.1007/978-3-030-60327-4_7zbMath1506.92033arXiv2007.08910OpenAlexW3043389728MaRDI QIDQ2110661

François Fages, Sylvain Soliman, Mathieu Hemery

Publication date: 22 December 2022

Full work available at URL: https://arxiv.org/abs/2007.08910

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Systems biology, networks (92C42)

Related Items (4)

Compiling elementary mathematical functions into finite chemical reaction networks via a polynomialization algorithm for ODEs ⋮ On estimating derivatives of input signals in biochemistry ⋮ Algebraic biochemistry: a framework for analog online computation in cells ⋮ Optimal monomial quadratization for ODE systems

This page was built for publication: On the complexity of quadratization for polynomial differential equations