Pages that link to "Item:Q626672"
From MaRDI portal
The following pages link to Lipschitz continuous ordinary differential equations are polynomial-space complete (Q626672):
Displaying 20 items.
- Computational complexity of solving polynomial differential equations over unbounded domains (Q264572) (← links)
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy (Q491087) (← links)
- The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited (Q714846) (← links)
- Primitive recursive ordered fields and some applications (Q831997) (← 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)
- Parametrised second-order complexity theory with applications to the study of interval computation (Q2285136) (← links)
- Computability aspects for 1st-order partial differential equations via characteristics (Q2342677) (← links)
- Analytical properties of resource-bounded real functionals (Q2509953) (← links)
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations (Q2693688) (← links)
- On Effective Convergence of Numerical Solutions for Differential Equations (Q2943897) (← links)
- On the computational complexity of the Dirichlet Problem for Poisson's Equation (Q4593239) (← links)
- Average-case polynomial-time computability of hamiltonian dynamics (Q5005130) (← links)
- Computability of Differential Equations (Q5024569) (← links)
- Weihrauch Complexity in Computable Analysis (Q5024577) (← links)
- Computing the exact number of periodic orbits for planar flows (Q5100021) (← links)
- Primitive recursive ordered fields and some applications (Q5880940) (← links)
- Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines (Q6048001) (← links)
- A continuous characterization of PSPACE using polynomial ordinary differential equations (Q6155896) (← links)
- Computer Science for Continuous Data (Q6487409) (← links)
