scientific article; zbMATH DE number 1246413

Publication date: 27 January 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

computational complexity information information-based complexity numerical algorithms complexity of continuous problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items

A constructive approach to strong tractability using quasi-Monte Carlo algorithms, Finite-order weights imply tractability of linear multivariate problems, Finite-order weights imply tractability of multivariate integration, Strong tractability of multivariate integration using quasi–Monte Carlo algorithms, A survey of randomized algorithms for control synthesis and performance verification, \(I\)-binomial scrambling of digital nets and sequences, The power of various real-valued quantum queries, Generalized tractability for multivariate problems. II: Linear tensor product problems, linear information, and unrestricted tractability, Tractability of multivariate integration for periodic functions, The quantum setting with randomized queries for continuous problems, On tractability of weighted integration over bounded and unbounded regions in ℝ^{𝕤}, Approximation of infinitely differentiable multivariate functions is not strongly tractable, Learning smooth shapes by probing, Tractability of quasilinear problems. I: General results, Generalized tractability for multivariate problems. I: Linear tensor product problems and linear information, Suboptimal solutions to dynamic optimization problems via approximations of the policy functions, Asymptotic analysis of average case approximation complexity of Hilbert space valued random elements, A fast algorithm to compute \(L(1/2, f\times \chi_q)\), Tight tractability results for a model second-order Neumann problem, Sufficient conditions for fast quasi-Monte Carlo convergence, Open problems for tractability of multivariate integration., Improved particle filters for multi-target tracking, Tsallis entropy measure of noise-aided information transmission in a binary channel, Intractability results for positive quadrature formulas and extremal problems for trigonometric polynomials, On the information-based complexity of stochastic programming, Stochastic computation based on orthogonal expansion of random fields, Continuous-time computation with restricted integration capabilities, Multivariate \(L_{\infty}\) approximation in the worst case setting over reproducing kernel Hilbert spaces, The complexity of some topological inference problems, Complexity of linear problems with a fixed output basis, Are unbounded linear operators computable on the average for Gaussian measures?, Black-Box and Data-Driven Computation, Complexity of general continuous minimization problems: a survey, Efficient approximation schemes for economic lot-sizing in continuous time, On Conjugate Gradient Algorithms as Objects of Scientific Study, Exponential tractability of linear weighted tensor product problems in the worst-case setting for arbitrary linear functionals, The cost of deterministic, adaptive, automatic algorithms: cones, not balls, Computability of Solutions of Operator Equations, Lattice rule algorithms for multivariate approximation in the average case setting, What is the complexity of volume calculation?, Quantum complexity of integration, Intractability results for integration and discrepancy, What is the complexity of surface integration?, Complexity of neural network approximation with limited information: A worst case approach, Computational complexity of the integration problem for anisotropic classes, Introduction to convex optimization in financial markets, The power of adaption for approximating functions with singularities, Stochastic finite element methods for partial differential equations with random input data, Complexity of Gaussian-radial-basis networks approximating smooth functions, Monte Carlo and Las Vegas randomized algorithms for systems and control. An introduction, On the tractability of linear tensor product problems in the worst case, Inverse regression for ridge recovery: a data-driven approach for parameter reduction in computer experiments, On the power of standard information for multivariate approximation in the worst case setting, A new conceptual framework for analog computation, A near-stationary subspace for ridge approximation, Polynomial-time algorithms for multivariate linear problems with finite-order weights: Average case setting, Weaker convergence criteria for Traub's method, Gaussian Quadrature and Polynomial Approximation for One-Dimensional Ridge Functions, What is the complexity of Stieltjes integration?, Delayed curse of dimension for Gaussian integration, Quadrature formulas for the Wiener measure, A Lipschitz Matrix for Parameter Reduction in Computational Science, Gauss-Christoffel quadrature for inverse regression: applications to computer experiments, Tractability of quasilinear problems II: Second-order elliptic problems, The power of standard information for multivariate approximation in the randomized setting, On the necessity of low-effective dimension, An optimal Monte Carlo algorithm for multivariate Feynman–Kac path integrals, Real computations with fake numbers, The Brownian bridge does not offer a consistent advantage in quasi-Monte Carlo integration, The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension, The effective dimension and quasi-Monte Carlo integration, Algorithmic analysis of irrational rotations in a single neuron model, Fast convergence of quasi-Monte Carlo for a class of isotropic integrals, Solving elliptic boundary value problems with uncertain coefficients by the finite element method: the stochastic formulation