On the computational complexity of reaction systems, revisited
From MaRDI portal
Publication:2117085
Cites work
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- Combinatorics of life and death for reaction systems
- Complexity of the dynamics of reaction systems
- Functional constructions between reaction systems and propositional logic
- Functions and sequences generated by reaction systems
- Introducing time in reaction systems
- Minimal reaction systems
- Minimal reaction systems revisited and reaction system rank
- On Chebyshev-Type Inequalities for Primes
- Reaction System Models for the Heat Shock Response
- Reaction systems
- Reaction systems and extremal combinatorics properties
- Relationships between nondeterministic and deterministic tape complexities
- Simple reaction systems and their classification
- Two-step simulations of reaction systems by minimal ones
Cited in
(8)- Complexity results for autocatalytic network models
- Computational complexity of reversible reaction systems
- Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks
- On the complexity of reconstructing chemical reaction networks
- Reaction Systems: A Model of Computation Inspired by Biochemistry
- scientific article; zbMATH DE number 6749560 (Why is no real title available?)
- scientific article; zbMATH DE number 7148979 (Why is no real title available?)
- Evolvability of reaction systems and the invisibility theorem
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)
