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).


https://hal.archives-ouvertes.fr/hal-01313640
Contributeur : Enrico Formenti <>
Soumis le : mardi 10 mai 2016 - 11:25:50
Dernière modification le : mercredi 11 mai 2016 - 01:07:28

Identifiants

Collections

Citation

Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio Porreca. Preimage Problems for Reaction Systems . LATA 2015, Mar 2015, Nice, France. Springer, 8977, pp.537-548, 2015, Lecture Notes in Computer Science. <10.1007/978-3-319-15579-1_42>. <hal-01313640>

Partager

Métriques

Consultations de la notice

36