Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems (Q2701384): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-022-01066-z / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-022-01066-Z / rank | |||
Normal rank | |||
Latest revision as of 20:56, 19 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems |
scientific article |
Statements
Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems (English)
0 references
28 April 2023
0 references
string algorithms
0 references
quantum algorithms
0 references
sublinear-time algorithms
0 references
fine-grained complexity
0 references
0 references
0 references
