Constrained Polynomial Multiplication
Frequently, one or both of the polynomials to be multiplied has some special characteristic, such as symmetry in the coefficients, coefficients that are zero or in G, or some other possibility. What are the effects of input constraints on the multiplicative complexity of systems of polynomial multiplication? This chapter shows precisely what types of constraints reduce multiplicative complexity. These results are then applied to the special case of products of polynomials exhibiting symmetry.
KeywordsDifference Equation Polynomial Multiplication Symmetric Polynomial Chinese Remainder Theorem Input Constraint
Unable to display preview. Download preview PDF.