Pages that link to "Item:Q3188250"
From MaRDI portal
The following pages link to Towards Computational Complexity Theory on Advanced Function Spaces in Analysis (Q3188250):
Displaying 11 items.
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy (Q491087) (← links)
- Computability structure of the Sobolev spaces and its applications (Q1292420) (← links)
- Quantitative coding and complexity theory of compact metric spaces (Q2106606) (← links)
- Parametrised second-order complexity theory with applications to the study of interval computation (Q2285136) (← links)
- On the Computational Complexity of Positive Linear Functionals on $$\mathcal{C}[0;1]$$ (Q2807870) (← links)
- A Note on the Space Complexity of Fast D-Finite Function Evaluation (Q2914999) (← links)
- New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces (Q4903466) (← links)
- Polynomial Running Times for Polynomial-Time Oracle Machines (Q5111319) (← links)
- Theory and Applications of Models of Computation (Q5898892) (← links)
- On Computational Constructions in Function Spaces (Q6081676) (← links)
- Computer Science for Continuous Data (Q6487409) (← links)