A polynomial time algorithm for almost bounded denumerant

Guoce Xin, Chen Zhang, Zihao Zhang

Sylvester's denumerant $d(t;\mathbf{A})$ counts the number of nonnegative integer solutions to ${\sum }_{i=1}^N{a}_i{x}_i=t$, where $\mathbf{A}=(a_1,\dots ,a_N)$ is a se…