Pages that link to "Item:Q2254073"
From MaRDI portal
The following pages link to On the complexity of reconstructing chemical reaction networks (Q2254073):
Displaying 14 items.
- Enumeration approach to computing chemical equilibria (Q391182) (← links)
- Reconstructing biochemical cluster networks (Q656982) (← links)
- Testing binomiality of chemical reaction networks using comprehensive Gröbner systems (Q831995) (← links)
- Identifiability of chemical reaction networks (Q937700) (← links)
- On finding hypercycles in chemical reaction networks (Q998585) (← links)
- Metabolic networks are NP-hard to reconstruct (Q1797721) (← links)
- Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks (Q2014813) (← links)
- Independent decompositions of chemical reaction networks (Q2035790) (← links)
- Netscan: a procedure for generating reaction networks by size (Q2186531) (← links)
- Complexity results for autocatalytic network models (Q2197746) (← links)
- Reachability analysis of low-order discrete state reaction networks obeying conservation laws (Q2325088) (← links)
- Solving moment hierarchies for chemical reaction networks (Q4595429) (← links)
- Comparing Chemical Reaction Networks (Q4635906) (← links)
- Automated reaction mapping (Q5406186) (← links)