Randomized and quantum algorithms yield a speed-up for initial-value problems (Q706788)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2132588
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Randomized and quantum algorithms yield a speed-up for initial-value problems |
scientific article; zbMATH DE number 2132588 |
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
0.902522623538971
0 references
0.8743627071380615
0 references
0.8428706526756287
0 references
0.8233998417854309
0 references
0.8199599385261536
0 references
