Pages that link to "Item:Q3088037"
From MaRDI portal
The following pages link to Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains (Q3088037):
Displaying 9 items.
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy (Q491087) (← links)
- Primitive recursive ordered fields and some applications (Q831997) (← links)
- 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)
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations (Q2693688) (← links)
- Computability of Differential Equations (Q5024569) (← links)
- Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems (Q5326355) (← links)
- Primitive recursive ordered fields and some applications (Q5880940) (← links)
