I have a set of linear binomials (x + a_i) with i from 0 to a very large number N. I want to multiply all binomials together efficiently. If I use FFT naively and apply it to each polynomial in the set I know it would not be more efficient than direct multiplication. What options do I have to compute the product in the least number of operations?