This question is a reformulation of Complexity for computing weighted number of paths on integer lattice
Is there any way to compute in $o(n^2)$ all $n$ sums $\sum_{0\leq i \leq j} a_i\binom{j}{i}$ for $j\in\{1,\dots,n\}$?
$\begingroup$
$\endgroup$
Add a comment
|