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

François Le Gall Saeed Seddighin

Published in: CoRR (2020)

Keyphrases

fine grained
coarse grained
optimization problems
data structure
computational complexity
access control
decision problems
database systems
worst case
tightly coupled
database
learning algorithm
bayesian networks
pairwise
pattern matching
polynomial time complexity