Preimage problems for reaction systems
International Conference on Language and Automata Theory and Applications, 2015•Springer
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\log n to FPSPACE (poly).
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\log n to FPSPACE (poly).
Abstract
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 to .
Springer
Showing the best result for this search. See all results