Preimage Problems for Reaction Systems
Résumé
We investigate the computational complexity of some problems related to preimages and ancestors of states of reaction systems. In particular, we prove that finding a minimum-cardinality preimage or ancestor, computing their size, or counting them are all intractable problems, with complexity ranging from FP^{NP[logn]} to FPSPACE(poly).