Presents an O(log b) time algorithm for the three-variable denumerant function d(n;a,b,c).
Aguil´ o-Gost and D
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Fast Algorithm for Denumerants with Three Variables
Presents an O(log b) time algorithm for the three-variable denumerant function d(n;a,b,c).