ADTC recasts optimization, counting and sampling over decision trees as semiring sum-of-products and supplies an O*(n^{O(Δ)}) DP algorithm plus tensor convolutions for multi-metric constraints.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Algebraic Model Counting for Global Analysis of Optimal Decision Trees
ADTC recasts optimization, counting and sampling over decision trees as semiring sum-of-products and supplies an O*(n^{O(Δ)}) DP algorithm plus tensor convolutions for multi-metric constraints.