Pages that link to "Item:Q3889994"
From MaRDI portal
The following pages link to Optimal sequential and non-sequential procedures for evaluating a functional (Q3889994):
Displaying 21 items.
- Adaption helps for some nonconvex classes (Q579828) (← links)
- On adaptive and non-adaptive stochastic and deterministic algorithms (Q749453) (← links)
- Can adaption help on the average? (Q760763) (← links)
- On piecewise-polynomial approximation of functions with a bounded fractional derivative in an \(L_ p\)-norm (Q810781) (← links)
- Optimal solution of nonlinear equations satisfying a Lipschitz condition (Q1051396) (← links)
- A survey of information-based complexity (Q1080661) (← links)
- On adaption with noisy information (Q1113867) (← links)
- On the adaptive and continuous information problems (Q1263941) (← links)
- On adaptive information with varying cardinality for linear problems with elliptically contoured measures (Q1263942) (← links)
- Information of varying cardinality (Q1821084) (← links)
- Testing linear operators (Q1904274) (← links)
- Complexity of linear problems with a fixed output basis (Q1977152) (← links)
- Generalized adaptive versus nonadaptive recovery from noisy information (Q2001212) (← links)
- Optimal approximation of elliptic problems by linear and nonlinear mappings. II (Q2507592) (← links)
- Adaption allows efficient integration of functions with unknown singularities (Q2574952) (← links)
- The power of adaption for approximating functions with singularities (Q3055072) (← links)
- The adaption problem for approximating linear operators (Q3484276) (← links)
- Recent developments in information-based complexity (Q3780359) (← links)
- Randomized complexity of parametric integration and the role of adaption. I: Finite dimensional case (Q6154554) (← links)
- Homogeneous algorithms and solvable problems on cones (Q6540037) (← links)
- Randomized complexity of mean computation and the adaption problem (Q6614418) (← links)
