Skip to main content
Conference Proceedings

Preimage problems for reaction systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015) 8977 537-548
DOI: 10.1007/978-3-319-15579-1_42
4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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[log n] to FPSPACE(poly).

Author supplied keywords

Cite

CITATION STYLE

APA

Dennunzio, A., Formenti, E., Manzoni, L., & Porreca, A. E. (2015). Preimage problems for reaction systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8977, pp. 537–548). Springer Verlag. https://doi.org/10.1007/978-3-319-15579-1_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free