Computational complexity of reversible reaction systems
From MaRDI portal
Publication:6148105
DOI10.1007/978-3-031-38100-3_4MaRDI QIDQ6148105
Christian Rauch, Markus Holzer
Publication date: 11 January 2024
Published in: Reversible Computation (Search for Journal in Brave)
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Other nonclassical models of computation (68Q09)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reaction systems and extremal combinatorics properties
- Halting space-bounded computations
- Hierarchies of complete problems
- Reversible space equals deterministic space
- Functions and sequences generated by reaction systems
- Simulating reversible computation with reaction systems
- Languages of distributed reaction systems
- On the computational complexity of reaction systems, revisited
- Complexity of the dynamics of reaction systems
- Relationships between nondeterministic and deterministic tape complexities
- SIMPLE REACTION SYSTEMS AND THEIR CLASSIFICATION
- Minimal Reaction Systems
- Minimal Reaction Systems Revisited and Reaction System Rank
- Reaction System Models for the Heat Shock Response
This page was built for publication: Computational complexity of reversible reaction systems
