Pages that link to "Item:Q2117085"
From MaRDI portal
The following pages link to On the computational complexity of reaction systems, revisited (Q2117085):
Displaying 7 items.
- Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks (Q2014813) (← links)
- Complexity results for autocatalytic network models (Q2197746) (← links)
- On the complexity of reconstructing chemical reaction networks (Q2254073) (← links)
- Evolvability of reaction systems and the invisibility theorem (Q2672641) (← links)
- Reaction Systems: A Model of Computation Inspired by Biochemistry (Q3584877) (← links)
- (Q5208581) (← links)
- (Q5279157) (← links)