Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1803.00618

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

Marcelo S. Reis
View original source ↗Read source document ↗Export metadata ↓

Abstract

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.

Explore related subjects

cs.CC

Keep this discovery

BibTeXRIS

Marcelo S. Reis. 2018-02-27. Finding steady-state solutions for ODE systems of zero, first and homogeneous second-order chemical reactions is NP-hard. https://arxiv.org/abs/1803.00618

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗
arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗