scientific article; zbMATH DE number 1246413
From MaRDI portal
Publication:4226567
Recommendations
Cited in
(93)- Multivariate algorithms and information-based complexity
- scientific article; zbMATH DE number 1859218 (Why is no real title available?)
- An optimal Monte Carlo algorithm for multivariate Feynman–Kac path integrals
- Computational complexity of the integration problem for anisotropic classes
- Gauss-Christoffel quadrature for inverse regression: applications to computer experiments
- scientific article; zbMATH DE number 7204267 (Why is no real title available?)
- Gaussian quadrature and polynomial approximation for one-dimensional ridge functions
- Computability of solutions of operator equations
- ABC on IBC
- Complexity of linear problems with a fixed output basis
- Complexity of general continuous minimization problems: a survey
- On the information-based complexity of stochastic programming
- Continuous problems: optimality, complexity, tractability (invited talk)
- Inverse regression for spatially distributed functional data
- Weaker convergence criteria for Traub's method
- A Lipschitz Matrix for Parameter Reduction in Computational Science
- Complexity of neural network approximation with limited information: A worst case approach
- On Conjugate Gradient Algorithms as Objects of Scientific Study
- A near-stationary subspace for ridge approximation
- scientific article; zbMATH DE number 3605746 (Why is no real title available?)
- scientific article; zbMATH DE number 5583062 (Why is no real title available?)
- Inverse regression for ridge recovery: a data-driven approach for parameter reduction in computer experiments
- Absolute value information for IBC problems
- Exponential tractability of linear weighted tensor product problems in the worst-case setting for arbitrary linear functionals
- Perspectives on information-based complexity
- Fast convergence of quasi-Monte Carlo for a class of isotropic integrals
- On tractability of weighted integration over bounded and unbounded regions in ℝ^{𝕤}
- Measures of uncertainty and information in computation
- A survey of randomized algorithms for control synthesis and performance verification
- Open problems for tractability of multivariate integration.
- Algorithmic analysis of irrational rotations in a single neuron model
- On the power of standard information for multivariate approximation in the worst case setting
- Finite-order weights imply tractability of multivariate integration
- scientific article; zbMATH DE number 3972186 (Why is no real title available?)
- \(I\)-binomial scrambling of digital nets and sequences
- Delayed curse of dimension for Gaussian integration
- A constructive approach to strong tractability using quasi-Monte Carlo algorithms
- The power of standard information for multivariate approximation in the randomized setting
- Are unbounded linear operators computable on the average for Gaussian measures?
- The cost of deterministic, adaptive, automatic algorithms: cones, not balls
- Finite-order weights imply tractability of linear multivariate problems
- Generalized tractability for multivariate problems. II: Linear tensor product problems, linear information, and unrestricted tractability
- Information-based complexity: New questions for mathematicians
- Quadrature formulas for the Wiener measure
- Complexity of Gaussian-radial-basis networks approximating smooth functions
- What is the complexity of Stieltjes integration?
- Tractability of quasilinear problems II: Second-order elliptic problems
- Improved particle filters for multi-target tracking
- Continuous-time computation with restricted integration capabilities
- Multivariate \(L_{\infty}\) approximation in the worst case setting over reproducing kernel Hilbert spaces
- A new conceptual framework for analog computation
- Black-Box and Data-Driven Computation
- The power of adaption for approximating functions with singularities
- scientific article; zbMATH DE number 193625 (Why is no real title available?)
- Introduction to convex optimization in financial markets
- Tractability of quasilinear problems. I: General results
- Strong tractability of multivariate integration using quasi–Monte Carlo algorithms
- Tractability of multivariate integration for periodic functions
- Efficient approximation schemes for economic lot-sizing in continuous time
- Approximation of infinitely differentiable multivariate functions is not strongly tractable
- The quantum setting with randomized queries for continuous problems
- Generalized tractability for multivariate problems. I: Linear tensor product problems and linear information
- 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)\)
- Solving elliptic boundary value problems with uncertain coefficients by the finite element method: the stochastic formulation
- Suboptimal solutions to dynamic optimization problems via approximations of the policy functions
- Structural and Quantitative Characteristics of Complexity in Terms of Information
- Monte Carlo and Las Vegas randomized algorithms for systems and control. An introduction
- Intractability results for positive quadrature formulas and extremal problems for trigonometric polynomials
- What is the complexity of surface integration?
- scientific article; zbMATH DE number 446839 (Why is no real title available?)
- On the necessity of low-effective dimension
- Stochastic computation based on orthogonal expansion of random fields
- Learning smooth shapes by probing
- Stochastic finite element methods for partial differential equations with random input data
- What is the complexity of volume calculation?
- Polynomial-time algorithms for multivariate linear problems with finite-order weights: Average case setting
- Real computations with fake numbers
- The complexity of some topological inference problems
- The Brownian bridge does not offer a consistent advantage in quasi-Monte Carlo integration
- Tight tractability results for a model second-order Neumann problem
- On the tractability of linear tensor product problems in the worst case
- Quantum complexity of integration
- Sufficient conditions for fast quasi-Monte Carlo convergence
- The power of various real-valued quantum queries
- The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
- Intractability results for integration and discrepancy
- Lattice rule algorithms for multivariate approximation in the average case setting
- Tsallis entropy measure of noise-aided information transmission in a binary channel
- Interactive Information Complexity
- Recent developments in information-based complexity
- There exists a problem whose computational complexity is any given function of the information complexity
- The effective dimension and quasi-Monte Carlo integration
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 Q4226567)
