Pages that link to "Item:Q2807870"
From MaRDI portal
The following pages link to On the Computational Complexity of Positive Linear Functionals on $$\mathcal{C}[0;1]$$ (Q2807870):
Displaying 6 items.
- Approximation to measurable functions and its relation to probabilistic computation (Q1088659) (← links)
- Parametrised second-order complexity theory with applications to the study of interval computation (Q2285136) (← links)
- Towards Computational Complexity Theory on Advanced Function Spaces in Analysis (Q3188250) (← links)
- (Q4517359) (← links)
- Polynomial Running Times for Polynomial-Time Oracle Machines (Q5111319) (← links)
- Computer Science for Continuous Data (Q6487409) (← links)