"Randomized and quantum algorithms yield a speed-up for initial-value problems."

Boleslaw Z. Kacewicz (2004)

> Home

Details and statistics

DOI: 10.1016/J.JCO.2004.05.002

access: open

type: Journal Article

metadata version: 2021-04-09

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jc/Kacewicz04a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jc/Kacewicz04a
Boleslaw Z. Kacewicz:
Randomized and quantum algorithms yield a speed-up for initial-value problems. J. Complex. 20(6): 821-834 (2004)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.