# Notes on (s, t)-weak tractability: A refined classification of problems with (sub)exponential information complexity

@article{Siedlecki2015NotesO, title={Notes on (s, t)-weak tractability: A refined classification of problems with (sub)exponential information complexity}, author={Pawe l Siedlecki and Markus Weimar}, journal={J. Approx. Theory}, year={2015}, volume={200}, pages={227-258} }

## 34 Citations

EC-(s, t)-weak tractability of multivariate linear problems in the average case setting

- MathematicsJ. Complex.
- 2019

On the power of standard information for L2-approximation in the average case setting

- MathematicsJ. Complex.
- 2020

Uniform Weak Tractability of Weighted Integration

- MathematicsMCQMC
- 2014

It is shown that as long as \(t>1\) then this notion holds for weighted integration defined over quite general tensor product Hilbert spaces with arbitrary bounded product weights.

On the power of standard information for tractability for L2-approximation in the randomized setting

- Mathematics, Computer ScienceContemporary Mathematics
- 2022

This work solves Open Problems 98, 101, 102 and almost solve Open Problem 100 as posed by E.Novak and H.Wo´zniakowski and investigates the equivalences of various notions of algebraic and exponential tractability in the randomized setting for Λstd and Λall for the normalized or absolute error criterion.

Tractability of approximation in the weighted Korobov space in the worst-case setting - a complete picture

- Mathematics, Computer ScienceJ. Complex.
- 2021

On the power of standard information for tractability for L2-approximation in the average case setting

- Mathematics, Computer ScienceJ. Complex.
- 2022

A note about EC-(s, t)-weak tractability of multivariate approximation with analytic Korobov kernels

- MathematicsJ. Complex.
- 2019

## References

SHOWING 1-10 OF 36 REFERENCES

A new criterion for tractability of multivariate problems

- Computer Science, MathematicsJ. Complex.
- 2014

The inverse of the star-discrepancy depends linearly on the dimension

- Mathematics
- 2001

We study bounds on the classical ∗-discrepancy and on its inverse. Let n∞(d, e) be the inverse of the ∗-discrepancy, i.e., the minimal number of points in dimension d with the ∗-discrepancy at most…

The curse of dimensionality for numerical integration of smooth functions II

- MathematicsJ. Complex.
- 2014

Approximation numbers of Sobolev embeddings - Sharp constants and tractability

- MathematicsJ. Complex.
- 2014

Tractability of multivariate analytic problems

- Mathematics, Computer ScienceUniform Distribution and Quasi-Monte Carlo Methods
- 2014

The goal of this paper is to survey the existing results, present some new results, and propose further questions for the study of tractability of multivariate analytic questions.

On the tractability of linear tensor product problems in the worst case

- MathematicsJ. Complex.
- 2009