A quantum algorithm solves wildcard pattern matching in O~(sqrt(n) sqrt(k)) time when the total number of wildcards k is at least sqrt(n).
Approximating edit distance in truly subquadratic time: Quantum and mapreduce
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Quantum Pattern Matching with Wildcards
A quantum algorithm solves wildcard pattern matching in O~(sqrt(n) sqrt(k)) time when the total number of wildcards k is at least sqrt(n).