Pages that link to "Item:Q1646245"
From MaRDI portal
The following pages link to On the complexity of occurrence and convergence problems in reaction systems (Q1646245):
Displaying 21 items.
- A graph isomorphism condition and equivalence of reaction systems (Q1682860) (← links)
- Facilitation in reaction systems (Q1982968) (← links)
- Simulation of reaction systems by the strictly minimal ones (Q1982969) (← links)
- Coping with dynamical reaction system topologies using deterministic P modules: a case study of photosynthesis (Q1982982) (← links)
- Controllability of reaction systems (Q1982983) (← links)
- Asynchrony and persistence in reaction systems (Q2044949) (← links)
- Communicating reaction systems with direct communication (Q2055826) (← links)
- Complexity of local, global and universality properties in finite dynamical systems (Q2104128) (← links)
- Characterization and computation of ancestors in reaction systems (Q2157013) (← links)
- Plug-in context providers for reaction systems (Q2192370) (← links)
- On classes of reaction networks and their associated polynomial dynamical systems (Q2201038) (← links)
- Reaction systems with influence on environment (Q2299880) (← links)
- Minimal reaction systems: duration and blips (Q2358692) (← links)
- Complexity of the dynamics of reaction systems (Q2417853) (← links)
- Evolvability of reaction systems and the invisibility theorem (Q2672641) (← links)
- (Q3691474) (← links)
- (Q5041956) (← links)
- (Q5208581) (← links)
- Minimal Reaction Systems Revisited and Reaction System Rank (Q5268395) (← links)
- Computing preimages and ancestors in reaction systems (Q6073010) (← links)
- Fixed points and attractors of reactantless and inhibitorless reaction systems (Q6140358) (← links)