TY - JOUR
T1 - A classification of algorithms for multiplying polynomials of small degree over finite fields
AU - Averbuch, Amir
AU - Bshouty, Nader H.
AU - Kaminski, Michael
PY - 1992/12
Y1 - 1992/12
N2 - It is shown that any optimal algorithm for computing the product of two degree-n polynomials over the q-element field, where n ≤ q, is based on the Chinese Remainder Theorem, with linear and quadratic polynomials presented as the moduli.
AB - It is shown that any optimal algorithm for computing the product of two degree-n polynomials over the q-element field, where n ≤ q, is based on the Chinese Remainder Theorem, with linear and quadratic polynomials presented as the moduli.
UR - http://www.scopus.com/inward/record.url?scp=38249008693&partnerID=8YFLogxK
U2 - 10.1016/0196-6774(92)90057-J
DO - 10.1016/0196-6774(92)90057-J
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:38249008693
SN - 0196-6774
VL - 13
SP - 577
EP - 588
JO - Journal of Algorithms
JF - Journal of Algorithms
IS - 4
ER -