Randomized and quantum algorithms yield a speed-up for initial-value problems (Q706788): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: DBLP publication ID (P1635): journals/jc/Kacewicz04a, #quickstatements; #temporary_batch_1731543907597
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: quant-ph/0311148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4819589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum summation with an application to integration. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum approximation. II: Sobolev embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4549490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to increase the order to get minimal-error algorithms for systems of ODE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum asymptotic error of algorithms for solving ODE / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sequential and parallel solution of initial value problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quantum query complexity of approximating the median and related statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic and stochastic error bounds in numerical analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum complexity of integration / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jc/Kacewicz04a / rank
 
Normal rank

Latest revision as of 01:29, 14 November 2024

scientific article
Language Label Description Also known as
English
Randomized and quantum algorithms yield a speed-up for initial-value problems
scientific article

    Statements

    Identifiers