Binary Huffman Coding with Unequal Letter Costs Is NP-Complete
cs.DS, cs.CC, cs.CG, cs.IT, math.IT
Submitted: 2026-11-03
Updated: 2026-11-03
Terminology
Sources
Related papers
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time
- Fast Odd-Permutation Sums in Characteristic Two and Shortest Even Directed Cycles