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 |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jco.2004.05.002 / rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jc/Kacewicz04a / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JCO.2004.05.002 / rank | |||
Normal rank | |||
Latest revision as of 02:22, 10 December 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
