The following pages link to Average case optimality (Q1071513):
Displaying 17 items.
- Automatic integration using asymptotically optimal adaptive simpson quadrature (Q495532) (← links)
- On the average complexity of multivariate problems (Q757054) (← links)
- The average a posteriori error of numerical methods (Q1071476) (← links)
- A survey of information-based complexity (Q1080661) (← links)
- Approximation of linear functionals on a Banach space with a Gaussian measure (Q1082039) (← links)
- For which error criteria can we solve nonlinear equations? (Q1086984) (← links)
- The algorithm designer versus nature: A game-theoretic approach to information-based complexity (Q1100895) (← links)
- Optimal solution of ordinary differential equations (Q1102074) (← links)
- Average complexity of divide-and-conquer algorithms (Q1114395) (← links)
- A stochastic analog to Chebyshev centers and optimal average case algorithms (Q1117550) (← links)
- On a class of omnibus algorithms for zero-finding (Q1118978) (← links)
- Optimal search algorithm for extrema of a discrete periodic bimodal function (Q1121183) (← links)
- Measures of uncertainty and information in computation (Q1194255) (← links)
- Information of varying cardinality (Q1821084) (← links)
- On average case errors in numerical analysis (Q1822459) (← links)
- Adaption allows efficient integration of functions with unknown singularities (Q2574952) (← links)
- The average error of quadrature formulas for functions of bounded variation (Q2640814) (← links)
