For a computable field F, the splitting set S is the set of polynomials p(X) ∈ F[X] which factor over F, and the root set R is the set of polynomials with roots in F. Work by Frohlich and Shepherdson ...

Higher Dividing and factorising polynomial expressions Factor theorem A polynomial is an algebraic expression involving many terms and can be factorised using long division or synthetic division.

MUCH use is made in combinatorial problems of generating functions in the form of polynomials and infinite power series, these being obtained by the manipulation of other algebraic expressions. In ...

This paper describes a general method for constructing fast algorithms for the cos-DFT, the sin-DFT and the DCT, which is based on polynomial arithmetic with Chebyshev polynomials and on the Chinese ...