✦ LIBER ✦

Quantum Complexity of Integration

✍ Scribed by Erich Novak

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 145 KB
Volume: 17
Category: Article
ISSN: 0885-064X
DOI: 10.1006/jcom.2000.0566

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Quantum Complexity of Integration: Volum

Quantum Complexity of Integration: Volume 17, Number 1 (2001), pages 2–16

✍ Erick Novak 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 186 KB

Quantum Kolmogorov Complexity

✍ André Berthiaume; Wim van Dam; Sophie Laplante 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 184 KB

In this paper we give a definition for quantum Kolmogorov complexity. In the classical setting, the Kolmogorov complexity of a string is the length of the shortest program that can produce this string as its output. It is a measure of the amount of innate randomness (or information) contained in the

Monte Carlo Complexity of Parametric Int

Monte Carlo Complexity of Parametric Integration

✍ Stefan Heinrich; Eugène Sindambiwe 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 193 KB

Complexity in quantum gravity

✍ Gerard `t Hooft 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 43 KB 👁 1 views

What Is the Complexity of Surface Integr

What Is the Complexity of Surface Integration?

✍ A.G. Werschulz; H. Woźniakowski 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 179 KB

We study the worst case complexity of computing =-approximations of surface integrals. This problem has two sources of partial information: the integrand f and the function g defining the surface. The problem is nonlinear in its dependence on g. Here, f is an r times continuously differentiable scal

What Is the Complexity of Stieltjes Inte

What Is the Complexity of Stieltjes Integration?

✍ Arthur G. Werschulz 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 121 KB