Conference paper
Performance measurement and data base design
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
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.
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM