Pages that link to "Item:Q491087"
From MaRDI portal
The following pages link to Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy (Q491087):
Displaying 8 items.
- Exact real computation of solution operators for linear analytic systems of partial differential equations (Q832000) (← links)
- Comparing representations for function spaces in computable analysis (Q1635809) (← 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)
- Towards Computational Complexity Theory on Advanced Function Spaces in Analysis (Q3188250) (← links)
- Representations and evaluation strategies for feasibly approximable functions (Q4995603) (← links)
- Representations of Analytic Functions and Weihrauch Degrees (Q5740198) (← links)
- Complexity of a root clustering algorithm for holomorphic functions (Q6496875) (← links)
