Recent developments in information-based complexity
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3755545 (Why is no real title available?)
- scientific article; zbMATH DE number 193625 (Why is no real title available?)
- scientific article; zbMATH DE number 3456359 (Why is no real title available?)
- scientific article; zbMATH DE number 3509627 (Why is no real title available?)
- scientific article; zbMATH DE number 3574966 (Why is no real title available?)
- scientific article; zbMATH DE number 3597592 (Why is no real title available?)
- scientific article; zbMATH DE number 3633568 (Why is no real title available?)
- scientific article; zbMATH DE number 3206529 (Why is no real title available?)
- scientific article; zbMATH DE number 3245885 (Why is no real title available?)
- scientific article; zbMATH DE number 3359503 (Why is no real title available?)
- scientific article; zbMATH DE number 3390954 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
- A Correspondence Between Bayesian Estimation on Stochastic Processes and Smoothing by Splines
- A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
- An algorithm to solve them ×n assignment problem in expected timeO(mn logn)
- Approximation of linear functionals on a Banach space with a Gaussian measure
- Are linear algorithms always good for linear problems?
- Average case optimal algorithms in Hilbert spaces
- Average case optimality
- Average case optimality for linear problems
- Best Approximate Integration Formulas; Best Approximation Formulas
- Best approximation of analytic functions from information about their values at a finite number of points
- Bisection is optimal
- Can adaption help on the average?
- Comparison of iterative methods for the calculation of n th roots
- Complexity of differential and integral equations
- Computational Complexity and the Existence of Complexity Gaps
- Computational complexity. On the geometry of polynomials and a theory of cost. I
- Do Linear Problems Have Linear Optimal Algorithms?
- Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average
- Gaussian measure in Hilbert space and applications in numerical analysis
- Gaussian measures in Banach spaces
- Information of varying cardinality
- Linear problems (with extended range) have linear optimal algorithms
- Monte-Carlo algorithms for the planar multiterminal network reliability problem
- On the Regression Design Problem of Sacks and Ylvisaker
- On the average number of steps of the simplex method of linear programming
- On the efficiency of algorithms of analysis
- On the existence of generally convergent algorithms
- Optimal Error Properties of Finite Element Methods for Second Order Elliptic Dirichlet Problems
- Optimal algorithms for linear problems with Gaussian measures
- Optimal sequential and non-sequential procedures for evaluating a functional
- Optimal solution of nonlinear equations
- Probabilistic setting of information-based complexity
- R-splines in Banach spaces. I: Interpolation of linear manifolds
- Sequential Minimax Search for a Maximum
- The fundamental theorem of algebra and complexity theory
- What is the complexity of elliptic systems?
Cited in
(21)- Perspectives on information-based complexity
- The adaption problem for approximating linear operators
- Linearity of algorithms and a result of Ando
- The algorithm designer versus nature: A game-theoretic approach to information-based complexity
- On the adaptive and continuous information problems
- There exists a linear problem with infinite combinatory complexity
- s-numbers in information-based complexity
- scientific article; zbMATH DE number 3972186 (Why is no real title available?)
- Information-based complexity: New questions for mathematicians
- Absolute value information for IBC problems
- Existence of smoothed stationary processes on an interval
- There exists a problem whose computational complexity is any given function of the information complexity
- On linearity of spline algorithms
- Continuous problems: optimality, complexity, tractability (invited talk)
- Measures of uncertainty and information in computation
- Complexity of verification and computation for IBC problems
- How powerful is continuous nonlinear information for linear problems?
- Some basic information on information-based complexity theory
- scientific article; zbMATH DE number 139625 (Why is no real title available?)
- Average case optimality
- scientific article; zbMATH DE number 446839 (Why is no real title available?)
This page was built for publication: Recent developments in information-based complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3780359)
