Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems (Q2701384)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems |
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
