Finding steady-state solutions for ODE systems of zero, first and homogeneous second-order chemical reactions is NP-hard

02/27/2018
by   Marcelo S. Reis, et al.
0

In the context of modeling of cell signaling pathways, a relevant step is finding steady-state solutions for ODE systems that describe the kinetics of a set of chemical reactions, especially sets composed of zero, first, and second-order reactions. To compute a steady-state solution, one must set the left-hand side of each ODE as zero, hence obtaining a system of non-negative, quadratic polynomial equations. If all second-order reactions are homogeneous in respect to their reactants, then the obtained quadratic polynomial equation system will also have univariate monomials. Although it is a well-known fact that finding a root of a quadratic polynomial equation system is a NP-hard problem, it is not so easy to find a readily available proof of NP-hardness for special cases like the aforementioned one. Therefore, we provide here a self-contained proof that finding a root of non-negative, with univariate monomials quadratic polynomial equation system (NUMQ-PES) is NP-hard. This result implies that finding steady-state solutions for ODE systems of zero, first and homogeneous second-order chemical reactions is a NP-hard problem; hence, it is not a feasible approach to approximate non-homogeneous second-order reactions into homogeneous ones.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/27/2018

Finding a root of constrained quadratic polynomial system is NP-hard

Here, we prove that finding a root of a quadratic polynomial system with...
research
01/22/2020

ASNP: a tame fragment of existential second-order logic

Amalgamation SNP (ASNP) is a fragment of existential second-order logic ...
research
01/22/2020

AMSNP: a tame fragment of existential second-order logic

Amalgamation monotone SNP (AMSNP) is a fragment of existential second-or...
research
09/27/2022

Solving homogeneous linear equations over polynomial semirings

For a subset B of ℝ, denote by U(B) be the semiring of (univariate) poly...
research
07/16/2019

A Reduced Order technique to study bifurcating phenomena: application to the Gross-Pitaevskii equation

We are interested in the steady state solution of the Gross-Pitaevskii e...
research
09/04/2018

Computing optimal discrete readout weights in reservoir computing is NP-hard

We show NP-hardness of a generalized quadratic programming problem, whic...
research
10/21/2020

A Note on the Approximability of Deepest-Descent Circuit Steps

Linear programs (LPs) can be solved through a polynomial number of so-ca...

Please sign up or login with your details

Forgot password? Click here to reset