Greatest common divisor
View as: 
Integer and polynomial GCD calculations: useful properties, Euclidean techniques,Resultants and the Sylvester matrix, non-Euclidean modular GCD by large/many small primes.
Archive for the ‘CM30070’ Category.
Buchberger’s Algorithm
View as:
An algorithm for determining a Gröbner basis for a collection of polynomials.
Gröbner Basis
View as:
A Gröbner basis for a system of polynomials preserves the common roots whilst being simpler relative to an ordering.
Canonical Representation of polynomials
View as:
Discussion of canonical forms for polynomials- single variable dense and sparse representations; orderings for multivariate polynomials.
