Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems (Q2701384): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:58, 3 February 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
