Xiaozhu Kang, Hui Zhang, et al.
ICWS 2008
In this paper we characterize all algorithms for obtaining the coefficients of (Σn-1i=0 xiui)(Σn-1i=0 yiui) mod P(u), where P(u) is an irreducible po lynomial of degree n, which use 2n - 1 multiplications. It is shown that up to equivalence, all such algorithms are obtainable by first obtaining the coefficients of the product of two polynomials, and then reducing modulo the irreducible polynomial. © 1979.
Xiaozhu Kang, Hui Zhang, et al.
ICWS 2008
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University