Polynomial-Time Evaluation of Aardal-Lenstra Denumerants via Constant Term Method
This work investigates the corresponding challenging denumerant problem and presents a polynomial-time algorithm that eliminates the computational bottlenecks caused by large values of $M$, $N$ and $b$.