GD string matching admits a classical Õ(N√m) algorithm, and combinatorial GD/ED indices cannot improve the known m-dependence under the k-clique conjecture.
Which Regular Expression Patterns Are Hard to Match?
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Algorithms and Indexing Lower Bounds for Variable String Matching
GD string matching admits a classical Õ(N√m) algorithm, and combinatorial GD/ED indices cannot improve the known m-dependence under the k-clique conjecture.