Pages that link to "Item:Q2912757"

The following pages link to Computational Complexity of Smooth Differential Equations (Q2912757):

Displaying 17 items.

• Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy (Q491087) (← links)
• Slutsky matrix norms: the size, classification, and comparative statics of bounded rationality (Q1676460) (← 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)
• The computational complexity of the initial value problem for the three body problem (Q2406877) (← 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)
• Computability on measurable functions (Q2964280) (← links)
• Towards Using Exact Real Arithmetic for Initial Value Problems (Q3179168) (← links)
• Towards Computational Complexity Theory on Advanced Function Spaces in Analysis (Q3188250) (← links)
• On the computational complexity of the Dirichlet Problem for Poisson's Equation (Q4593239) (← links)
• Computability of Differential Equations (Q5024569) (← links)
• Computing the exact number of periodic orbits for planar flows (Q5100021) (← links)
• (Q5404471) (redirect page) (← 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)