Pages that link to "Item:Q4640346"
From MaRDI portal
The following pages link to Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Q4640346):
Displaying 11 items.
- Programming with ordinary differential equations: some first steps towards a programming language (Q2104250) (← links)
- Robust real-time computing with chemical reaction networks (Q2152084) (← links)
- On the stability of nucleic acid feedback control systems (Q2207245) (← links)
- A Survey on Analog Models of Computation (Q5024572) (← links)
- Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations (Q5092382) (← links)
- A Universal Ordinary Differential Equation (Q5109517) (← links)
- Characterizing time computational complexity classes with polynomial differential equations (Q5880938) (← links)
- Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines (Q6048001) (← links)
- A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations (Q6116835) (← links)
- \textit{CRN}++: molecular programming language (Q6151178) (← links)
- A continuous characterization of PSPACE using polynomial ordinary differential equations (Q6155896) (← links)