Learn More
We study polynomial interpolation on a d-dimensional cube, where d is large. We suggest to use the least solution at sparse grids with the extrema of the Chebyshev polynomials. The polynomial exactness of this method is almost optimal. Our error bounds show that the method is universal, i.e., almost optimal for many different function spaces. We report on(More)
It is known that quantum computers yield a speed-up for certain discrete problems. Here we want to know whether quantum computers are useful for continuous problems. We study the computation of the integral of functions from the classical Hölder classes F k,α d on [0, 1] d and define γ by γ = (k + α)/d. The known optimal orders for the complexity of(More)
We give a path integral prescription for the pair correlation function of Wilson loop observables on the worldvolume of a Dbrane in the bosonic string theory in flat spacetime. We determine the coefficient of the 1/R term in the static heavy quark potential from the static pair correlation function of Wilson lines at small spatial separation in the critical(More)
We prove that L∞-approximation of C ∞-functions defined on [0, 1]d is intractable and suffers from the curse of dimensionality. This is done by showing that the minimal number of linear functionals needed to obtain an algorithm with worst case error at most ε ∈ (0, 1) is exponential in d. This holds despite the fact that the rate of convergence is infinite.