Ancestors, descendants, and gardens of Eden in reaction systems

Abstract : This paper analyses several problems related to finding and counting ancestor and descendant states, as well as gardens of Eden (i.e., states without predecessors) in reaction systems. The focus is on the complexity of finding and counting preimages and ancestors that are minimal with respect to cardinality. It turns out that the problems concerning gardens of Eden seem to require the presence of an NP-oracle to be solved. All the problems studied are intractable, with a complexity that ranges form FPNP[log⁡n] to FPSPACE(poly).
Liste complète des métadonnées
Contributeur : Enrico Formenti <>
Soumis le : mardi 10 mai 2016 - 11:33:34
Dernière modification le : jeudi 7 février 2019 - 16:31:29

Lien texte intégral




Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio Porreca. Ancestors, descendants, and gardens of Eden in reaction systems. Theoretical Computer Science, Elsevier, 2015, From Computer Science to Biology and Back, 608, pp.16-26. 〈〉. 〈10.1016/j.tcs.2015.05.046〉. 〈hal-01313664〉



Consultations de la notice