Pages that link to "Item:Q796299"
From MaRDI portal
The following pages link to Average case optimality for linear problems (Q796299):
Displaying 20 items.
- A survey of average case complexity for linear multivariate problems (Q462594) (← links)
- Tractability of infinite-dimensional integration in the worst case and randomized settings (Q647921) (← links)
- s-numbers in information-based complexity (Q757049) (← links)
- Can adaption help on the average? (Q760763) (← links)
- Orthogonal projections are optimal algorithms (Q788227) (← links)
- Orthogonally invariant measures and best approximation of linear operators (Q915052) (← links)
- The average a posteriori error of numerical methods (Q1071476) (← links)
- Average case optimality (Q1071513) (← links)
- Average case optimal algorithms in Hilbert spaces (Q1073284) (← links)
- A survey of information-based complexity (Q1080661) (← links)
- Parallel and sequential computation: A statistician's view (Q1084862) (← links)
- Average complexity of divide-and-conquer algorithms (Q1114395) (← links)
- A probabilistic theory for error estimation in automatic integration (Q1116644) (← links)
- Optimal linear randomized methods for linear operators in Hilbert spaces (Q1190530) (← links)
- The verification of modules (Q1329200) (← links)
- Information of varying cardinality (Q1821084) (← links)
- On average case errors in numerical analysis (Q1822459) (← links)
- How powerful is continuous nonlinear information for linear problems? (Q1822461) (← links)
- Solving and learning nonlinear PDEs with Gaussian processes (Q2133484) (← links)
- Recent developments in information-based complexity (Q3780359) (← links)
