论文部分内容阅读
We consider the complexity of multiplying two univariate polynomials given by their sparse representations.A product of sparse polynomials may have up to quadratically many terms compared to the inputs,but possibly as few as a constant number of terms.