Quality-control versions of pattern counting in sequences can be solved in poly(k) time despite worst-case approximate counting requiring exp(k) queries.
Combinatorica , volume=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Quality Control Algorithms for Pattern Counting
Quality-control versions of pattern counting in sequences can be solved in poly(k) time despite worst-case approximate counting requiring exp(k) queries.