On the computational complexity of reaction systems, revisited

DOI10.1007/978-3-030-79416-3_10OpenAlexW3177031355MaRDI QIDQ2117085

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

zbMATH Keywords

equivalencecomputational complexityminimalityreaction systemthreshold property(multi-step) simulation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Evolvability of reaction systems and the invisibility theorem ⋮ Computational complexity of reversible reaction systems

Cites Work

• Unnamed Item
• Unnamed Item
• Reaction systems and extremal combinatorics properties
• Introducing time in reaction systems
• Functions and sequences generated by reaction systems
• Complexity of the dynamics of reaction systems
• Relationships between nondeterministic and deterministic tape complexities
• Two-Step Simulations of Reaction Systems by Minimal Ones
• FUNCTIONAL CONSTRUCTIONS BETWEEN REACTION SYSTEMS AND PROPOSITIONAL LOGIC
• SIMPLE REACTION SYSTEMS AND THEIR CLASSIFICATION
• COMBINATORICS OF LIFE AND DEATH FOR REACTION SYSTEMS
• On Chebyshev-Type Inequalities for Primes
• 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: On the computational complexity of reaction systems, revisited