Pages that link to "Item:Q5005130"
From MaRDI portal
The following pages link to Average-case polynomial-time computability of hamiltonian dynamics (Q5005130):
Displaying 9 items.
- Exact real computation of solution operators for linear analytic systems of partial differential equations (Q832000) (← links)
- Computational complexity of classical solutions of partial differential equations (Q2104279) (← links)
- Bit-complexity of solving systems of linear evolutionary partial differential equations (Q2117092) (← links)
- Computability of topological entropy: from general systems to transformations on Cantor sets and the interval (Q2176543) (← links)
- Parametrised second-order complexity theory with applications to the study of interval computation (Q2285136) (← links)
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations (Q2693688) (← links)
- Computability of Differential Equations (Q5024569) (← links)
- A Universal Ordinary Differential Equation (Q5109517) (← links)
- Solovay reducibility and continuity (Q5145846) (← links)
