Binary Smallest Grammar Problem NP-completeness candidate proof - manuscript, verification code, reproducibility tests, and expert-audit materials.
reproducible-research np-complete finite-fields data-compression theoretical-computer-science formal-languages string-algorithms algorithmic-information-theory computational-complexity binary-strings complexity-theory slp grammar-compression lossless-compression combinatorics-on-words assembly-index open-problem research-preprint smallest-grammar-problem straight-line-programs
-
Updated
Sep 3, 2026 - TeX