scientific article; zbMATH DE number 3827201
From MaRDI portal
Publication:3673103
algebraic coding theoryapplicationsapproximate solutionbin- packingdecision theorydiscrete and continuous binary searchdistributed computationinformation theorylinear and nonlinear equationsoptimal algorithmssolution operatoruncertaintyworst case analysis
Iterative numerical methods for linear systems (65F10) Numerical computation of solutions to systems of equations (65H10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99) Combinatorial codes (94B25)
Cited in
(65)- Optimal solution of nonlinear equations satisfying a Lipschitz condition
- Basic principles of feedback and adaptive approaches in the finite element method
- Optimal algorithms for image understanding: Current status and future plans
- Average case optimal algorithms in Hilbert spaces
- A survey of information-based complexity
- Approximation of linear functionals on a Banach space with a Gaussian measure
- Complexity of differential and integral equations
- For which error criteria can we solve nonlinear equations?
- Optimal solution of nonlinear equations
- Optimality of central and projection algorithms for bounded uncertainty
- Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
- Maximum likelihood estimators and worst case optimal algorithms for system identification
- Algorithmic and complexity issues of robot motion in an uncertain environment
- Engineering control systems and computing in the 90s
- Conditionally optimal algorithms and estimation of reduced order models
- Average complexity of divide-and-conquer algorithms
- Optimal search algorithm for extrema of a discrete periodic bimodal function
- Complexity of functions: Some questions, conjectures, and results
- On the computational complexity of integral equations
- Shape from shadows. A Hilbert space setting
- Risk, uncertainty, and complexity
- An approach to the physics of complexity
- Two schemes for information acquisition: An entropic assessment
- On the complexity of linear quadratic control
- Worst case complexity of weighted approximation and integration over \(\mathbb{R}^d\)
- Near-optimality of linear recovery from indirect observations
- Counterexamples in optimal quadrature
- Information of varying cardinality
- On average case errors in numerical analysis
- How powerful is continuous nonlinear information for linear problems?
- On linearity of spline algorithms
- On optimal algorithms for problems defined on groups
- Surrogates for numerical simulations; optimization of eddy-promoter heat exchangers
- Complexity of weighted approximation over \(\mathbb{R}\)
- On a central algorithm for calculation of the inverse of the harmonic oscillator in the spaces of orbits
- Some nonlinear problems are as easy as the approximation problem
- Strong convergence rates of probabilistic integrators for ordinary differential equations
- A modern retrospective on probabilistic numerics
- Information based complexity for high dimensional sparse functions
- Efficient iterative methods with and without memory possessing high efficiency indices
- Approximation, solution operators and quantale-valued metrics
- Necessary and sufficient conditions for robust identification of uncertain LTIstems
- Optimal approximation of elliptic problems by linear and nonlinear mappings. II
- On the minimal cost of approximating linear problems based on information with deterministic noise
- Optimal error predictors for economic models
- Some basic information on information-based complexity theory
- Perspectives on information-based complexity
- Errors and optimality for spatial approximations in one-dimensional transport
- Worst-case errors for some spatial approximations to a model problem in two-dimensional transport theory
- Complexity of operators on compact sets
- Complexity of optimizing over the integers
- Optimal cubature formulas for tensor products of certain classes of functions
- Beyond post-quantum cryptography: cryptosystems that are secure in certain computation models
- Applying the general theory of optimal algorithms in cryptography, steganography, and blockchain technology
- Elements of the general theory of optimal algorithms
- Full C(N)D-study of computational capabilities of Lagrange polynomials
- Some thoughts on compositional tensor networks
- Average case complexity of weighted approximation and integration over \(\mathbb R_{+}\)
- Approximation of solutions of the heat equation by inaccurate information
- Probabilistic complexity analysis for linear problems in bounded domains
- Minimax quadratic estimation of a quadratic functional
- Measuring uncertainty without a norm
- Asymptotic analysis of average case approximation complexity of Hilbert space valued random elements
- Using CAPTCHA in computer steganography
- Exponential lower bounds for finding Brouwer fixed points
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3673103)
