"Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms ..."

François Le Gall, Saeed Seddighin (2023)

> Home

Details and statistics

DOI: 10.1007/S00453-022-01066-Z

access: open

type: Journal Article

metadata version: 2023-05-13

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithmica/GallS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/GallS23
François Le Gall, Saeed Seddighin:
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems. Algorithmica 85(5): 1251-1286 (2023)

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.