Pages that link to "Item:Q617652"
From MaRDI portal
The following pages link to Lower bounds for the complexity of linear functionals in the randomized setting (Q617652):
Displaying 7 items.
- Probabilistic complexity analysis for linear problems in bounded domains (Q757053) (← links)
- Lower bound on complexity of optimization of continuous functions (Q1888381) (← links)
- On the Computational Complexity of Positive Linear Functionals on $$\mathcal{C}[0;1]$$ (Q2807870) (← links)
- Some Results on the Complexity of Numerical Integration (Q2957029) (← links)
- Linear FPT reductions and computational lower bounds (Q3580971) (← links)
- (Q4517359) (← links)
- Lower space bounds for randomized computation (Q4632458) (← links)