Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems.

François Le Gall Saeed Seddighin

Published in: Algorithmica (2023)

Keyphrases

fine grained
coarse grained
optimization problems
data structure
computational complexity
worst case
space complexity
access control
massively parallel
tightly coupled
learning algorithm
decision problems
high level
pairwise
probabilistic model
binary search trees