Skip to Main content Skip to Navigation
Conference papers

Preimage Problems for Reaction Systems

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 FP^{NP[logn]} to FPSPACE(poly).
Complete list of metadatas
Contributor : Enrico Formenti <>
Submitted on : Tuesday, May 10, 2016 - 11:25:50 AM
Last modification on : Tuesday, May 26, 2020 - 6:50:56 PM




Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio Porreca. Preimage Problems for Reaction Systems . LATA 2015, Adrian-Horia Dediu; Enrico Formenti; Carlos Martín-Vide; Bianca Truthe, Mar 2015, Nice, France. pp.537-548, ⟨10.1007/978-3-319-15579-1_42⟩. ⟨hal-01313640⟩



Record views