## Preliminary list of abstracts

**Note:** We are using the fantastic MathJax JavaScript library to typeset the mathematics on this web page.
You can right-click on a formula to zoom in or to select the rendering engine you like (all under 'Settings').
Under Firefox the default renderer turns out to be MathML (which is quick), but you might prefer the HTML-CSS renderer for more faithful LaTeX rendering.
If you encounter any problems with this setup: then please email us!

Click here to go back to the list of abstracts.

*Keywords:*Tractability; $L_\infty$-approximation

- Weimar, Markus (Mathematical Institute, Friedrich-Schiller-University Jena, Germany)

In this talk we study the worst case error of $L_\infty$-approximation for multivariate smooth functions $f \colon [0,1]^d \rightarrow \mathbb{R}$ from certain weighted Banach spaces $F_d^\gamma$. Since it is well-known that we can reach an excellent rate of convergence with respect to $n$, the amount of information on $f$ used by an approximation-algorithm, we especially consider the dependence of the error bounds on the dimension $d$. It turns out that this dependence and therefore also the complexity of the problem are strongly connected to the weight $\gamma$ which characterizes the function space.

We will present necessary and sufficient conditions for tractability in the case of product weights. The talk is based on [1].

*Submitted to J. Complexity*.