关于多项式微分方程二次化的复杂性
On the Complexity of Quadratization for Polynomial Differential Equations
摘要:
化学反应网络(CRN)是化学和生物学中用于推理分子相互作用网络动力学的标准形式。在常微分方程的解释中,CRN提供了模拟计算的图灵完备模型,在这个意义上,实数上的任何可计算函数都可以由有限数量的分子物种计算,连续CRN以任意精度近似该函数的结果。这个结果的证明是基于Bournez等人关于多项式初值常微分方程的图灵完备性的一个结果。它使用两个非负变量对浓度进行实变量编码,并转换为等效的二次PIVP(即度最多为2),以限制我们最多进行双分子反应。本文研究了二次变换的理论复杂性和实际复杂性。我们表明,这两个问题的最小化或变量的数量(即,分子种类)或单项式(即基元反应)的数量在PIVP的二次变换中是NP难的。我们提出了一个编码的MAX-SAT的这些问题,并显示该算法的实际复杂性的基准上的正交化问题的启发CRN的设计问题。
英文摘要:
Chemical reaction networks (CRNs) are a standard formalism used in chemistry and biology to reason about the dynamics of molecular interaction networks. In their interpretation by ordinary differential equations, CRNs provide a Turing-complete model of analog computattion, in the sense that any computable function over the reals can be computed by a finite number of molecular species with a continuous CRN which approximates the result of that function in one of its components in arbitrary precision. The proof of that result is based on a previous result of Bournez et al. on the Turing-completeness of polyno-mial ordinary differential equations with polynomial initial conditions (PIVP). It uses an encoding of real variables by two non-negative variables for concentrations, and a transformation to an equivalent quadratic PIVP (i.e. with degrees at most 2) for restricting ourselves to at most bimolecular reactions. In this paper, we study the theoretical and practical complexities of the quadratic transformation. We show that both problems of minimizing either the number of variables (i.e., molecular species) or the number of monomials (i.e. elementary reactions) in a quadratic transformation of a PIVP are NP-hard. We present an encoding of those problems in MAX-SAT and show the practical complexity of this algorithm on a benchmark of quadratization problems inspired from CRN design problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。