Subsequence matching with gap-constraints is solvable in O(|D|(|u| + |C|)) time under left-convexity of the languages, optimal under SETH.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2representative citing papers
New enumeration algorithms for minimal removable sets in monotone systems yield O((n+m) log n) time for k-cores and O((n+m) log n)-delay for all k-core subgraphs.
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.