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

02/27/2018

∙

by   Marcelo S. Reis, et al.

∙

0

∙

share

Here, we prove that finding a root of a quadratic polynomial system with non-negative variables is a NP-hard problem. This result has impact on dynamic system identification on the context of molecular signaling networks whose kinetics is described as a set of chemical reactions, which often is the case in modeling Ras/MAPK and other signaling pathways.