Subsequence matching with gap-constraints is solvable in O(|D|(|u| + |C|)) time under left-convexity of the languages, optimal under SETH.
Cohen, and Marc Gyssens
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
-
Tractable Gap-Constraint Languages for Complex Event Recognition
Subsequence matching with gap-constraints is solvable in O(|D|(|u| + |C|)) time under left-convexity of the languages, optimal under SETH.