Fixed Points and Attractors of Reaction Systems
Résumé
We investigate the computational complexity of deciding the occurrence of many different dynamical behaviours in reaction systems, with an emphasis on biologically relevant problems (i.e., existence of fixed points and fixed point attractors). We show that the decision problems of recognising these dynamical behaviours span a number of complexity classes ranging from FO-uniform AC^0 to Π_2^P-completeness with several intermediate problems being either NP or coNP-complete.