On the computational complexity of reaction systems, revisited
From MaRDI portal
Publication:2117085
DOI10.1007/978-3-030-79416-3_10OpenAlexW3177031355MaRDI QIDQ2117085FDOQ2117085
Christian Rauch, Markus Holzer
Publication date: 21 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-79416-3_10
computational complexityequivalenceminimalityreaction systemthreshold property(multi-step) simulation
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Introducing time in reaction systems
- Functions and sequences generated by reaction systems
- Relationships between nondeterministic and deterministic tape complexities
- Functional constructions between reaction systems and propositional logic
- Reaction System Models for the Heat Shock Response
- Minimal Reaction Systems
- On Chebyshev-Type Inequalities for Primes
- COMBINATORICS OF LIFE AND DEATH FOR REACTION SYSTEMS
- Reaction systems and extremal combinatorics properties
- Two-step simulations of reaction systems by minimal ones
- Simple reaction systems and their classification
- Complexity of the dynamics of reaction systems
- Minimal Reaction Systems Revisited and Reaction System Rank
Cited In (8)
- Title not available (Why is that?)
- Computational complexity of reversible reaction systems
- Complexity results for autocatalytic network models
- On the complexity of reconstructing chemical reaction networks
- Evolvability of reaction systems and the invisibility theorem
- Reaction Systems: A Model of Computation Inspired by Biochemistry
- Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks
- Title not available (Why is that?)
This page was built for publication: On the computational complexity of reaction systems, revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117085)
