A new dynamic program finds the minimum-density minimizer in w·2^{σ^k+O(k)} time, and a regular-language method gives eventually optimal orders for small alphabets.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On Minimizers of Minimum Density
A new dynamic program finds the minimum-density minimizer in w·2^{σ^k+O(k)} time, and a regular-language method gives eventually optimal orders for small alphabets.