Szczegóły publikacji
Opis bibliograficzny
Almost optimal solution of initial-value problems by randomized and quantum algorithms / Bolesław KACEWICZ // Journal of Complexity ; ISSN 0885-064X. — 2006 — vol. 22 iss. 5, s. 676–690. — Bibliogr. s. 690, Abstr. — Publikacja dostępna online od: 2006-05-11. — Information-Based Complexity Workshop : Santander, Spain, July, 2005
Autor
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 31558 |
|---|---|
| Data dodania do BaDAP | 2007-02-17 |
| Tekst źródłowy | URL |
| DOI | 10.1016/j.jco.2006.03.001 |
| Rok publikacji | 2006 |
| Typ publikacji | referat w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Journal of Complexity |
Abstract
We establish essentially optimal bounds on the complexity of initial-value problems in the randomized and quantum settings. For this purpose we define a sequence of new algorithms whose error/cost properties improve from step to step. These algorithms yield new upper complexity bounds, which differ from known lower bounds by only an arbitrarily small positive parameter in the exponent, and a logarithmic factor. In both the randomized and quantum settings, initial-value problems turn out to be essentially as difficult as scalar integration. (C) 2006 Elsevier Inc. All rights reserved.
