Skip to content

Tag

Polynomial GCD

5 resources tagged “Polynomial GCD” across the knowledge library.

5 items

Article7 Aug 2026Polynomial GCD over a Unique Factorisation DomainComputing polynomial GCDs over the integers, the growth problem in remainder sequences, and the modular approach that sidesteps it.2 min readRead More Article7 Aug 2026The Dedekind Criterion for p-MaximalityA cheap modular test deciding whether an order is maximal at a given prime, without computing the maximal order.2 min readRead More Article7 Aug 2026The Polynomial Euclidean Algorithm over a FieldThe Euclidean and extended Euclidean algorithms for polynomials over a field, and their role in inversion and interpolation.2 min readRead More Article7 Aug 2026The Sub-Resultant GCD AlgorithmThe sub-resultant remainder sequence: predicting the divisible factor at each step to keep coefficients near minimal without content computation.2 min readRead More Guide6 Aug 2026Polynomial Arithmetic and GCD in Unique Factorisation DomainsDense and sparse polynomial representation, multiplication algorithms, pseudo-division over a UFD, primitive parts and content, and the subresultant and modular remedies for coefficient growth.4 min readRead More