Randomized and quantum algorithms yield a speed-up for initial-value problems (Q706788): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/jc/Kacewicz04a, #quickstatements; #temporary_batch_1731543907597 |
||
| 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
Randomized and quantum algorithms yield a speed-up for initial-value problems (English)
0 references
9 February 2005
0 references
Randomized algorithms
0 references
Quantum algorithms
0 references
Initial-value problems
0 references
