Almost optimal solution of initial-value problems by randomized and quantum algorithms
Author:
- Bolesław KacewiczBKBolesław Kacewicz
- 1 October 2006
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 22 (5) , 676-690
Abstract
No abstract availableKeywords
All Related Versions
This publication has 5 references indexed in Scilit:
- Improved bounds on the randomized and quantum complexity of initial-value problemsJournal of Complexity, 2005
- Randomized and quantum algorithms yield a speed-up for initial-value problemsJournal of Complexity, 2004
- Quantum Summation with an Application to IntegrationJournal of Complexity, 2002
- Optimal Summation and Integration by Deterministic, Randomized, and Quantum Algorithms2002
- Optimal solution of ordinary differential equationsJournal of Complexity, 1987