4 citations · 6 across the 11 of their papers we have counts for
1 paper · 1 filter
Vasileios Nakos
In the sparse polynomial multiplication problem, one is asked to multiply two sparse polynomials f and g in time that is proportional to the size of the input plus the size of the…