A new BDM variant formalizes reuse of program code across blocks as an NP-hard optimization problem, relates gains to algorithmic mutual information, and proves improvement over independent block descriptions under stated conditions.
Neural Attention Models in Deep Learning: Survey and Taxonomy, 2021
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Tighter Bounds for Algorithmic Complexity Estimation Using a Reusable Code-Based Block Decomposition Method
A new BDM variant formalizes reuse of program code across blocks as an NP-hard optimization problem, relates gains to algorithmic mutual information, and proves improvement over independent block descriptions under stated conditions.