The following pages link to (Q3673103):
Displaying 50 items.
- Optimal cubature formulas for tensor products of certain classes of functions (Q647923) (← links)
- Average case complexity of weighted approximation and integration over \(\mathbb R_{+}\) (Q700174) (← links)
- Probabilistic complexity analysis for linear problems in bounded domains (Q757053) (← links)
- Minimax quadratic estimation of a quadratic functional (Q758038) (← links)
- Measuring uncertainty without a norm (Q798906) (← links)
- Asymptotic analysis of average case approximation complexity of Hilbert space valued random elements (Q890228) (← links)
- Using CAPTCHA in computer steganography (Q904437) (← links)
- Exponential lower bounds for finding Brouwer fixed points (Q911230) (← links)
- Optimal solution of nonlinear equations satisfying a Lipschitz condition (Q1051396) (← links)
- Basic principles of feedback and adaptive approaches in the finite element method (Q1062437) (← links)
- Optimal algorithms for image understanding: Current status and future plans (Q1071510) (← links)
- Average case optimal algorithms in Hilbert spaces (Q1073284) (← links)
- A survey of information-based complexity (Q1080661) (← links)
- Approximation of linear functionals on a Banach space with a Gaussian measure (Q1082039) (← links)
- Complexity of differential and integral equations (Q1085950) (← links)
- For which error criteria can we solve nonlinear equations? (Q1086984) (← links)
- Optimal solution of nonlinear equations (Q1086985) (← links)
- Optimality of central and projection algorithms for bounded uncertainty (Q1100150) (← links)
- Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape (Q1102132) (← links)
- Maximum likelihood estimators and worst case optimal algorithms for system identification (Q1105558) (← links)
- Algorithmic and complexity issues of robot motion in an uncertain environment (Q1109740) (← links)
- Engineering control systems and computing in the 90s (Q1110473) (← links)
- Conditionally optimal algorithms and estimation of reduced order models (Q1112002) (← links)
- Average complexity of divide-and-conquer algorithms (Q1114395) (← links)
- Optimal search algorithm for extrema of a discrete periodic bimodal function (Q1121183) (← links)
- Complexity of functions: Some questions, conjectures, and results (Q1174450) (← links)
- On the computational complexity of integral equations (Q1207544) (← links)
- Shape from shadows. A Hilbert space setting (Q1265139) (← links)
- Risk, uncertainty, and complexity (Q1309846) (← links)
- An approach to the physics of complexity (Q1321728) (← links)
- Two schemes for information acquisition: An entropic assessment (Q1328045) (← links)
- On the complexity of linear quadratic control (Q1330536) (← links)
- Worst case complexity of weighted approximation and integration over \(\mathbb{R}^d\) (Q1599206) (← links)
- Near-optimality of linear recovery from indirect observations (Q1739121) (← links)
- Counterexamples in optimal quadrature (Q1820547) (← 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)
- On linearity of spline algorithms (Q1823607) (← links)
- On optimal algorithms for problems defined on groups (Q1824380) (← links)
- Surrogates for numerical simulations; optimization of eddy-promoter heat exchangers (Q1913240) (← links)
- Complexity of weighted approximation over \(\mathbb{R}\) (Q1976271) (← links)
- On a central algorithm for calculation of the inverse of the harmonic oscillator in the spaces of orbits (Q2052166) (← links)
- Some nonlinear problems are as easy as the approximation problem (Q2266192) (← links)
- Strong convergence rates of probabilistic integrators for ordinary differential equations (Q2302455) (← links)
- A modern retrospective on probabilistic numerics (Q2302460) (← links)
- Information based complexity for high dimensional sparse functions (Q2303421) (← links)
- Efficient iterative methods with and without memory possessing high efficiency indices (Q2321541) (← links)
- Approximation, solution operators and quantale-valued metrics (Q2407702) (← links)
- Necessary and sufficient conditions for robust identification of uncertain LTIstems (Q2503650) (← links)
