2 citations · 2 across the 3 of their papers we have counts for
5 papers
High performance SIMD modular arithmetic for polynomial evaluation
Pierre Fortin, Ambroise Fleury, François Lemaire +1
Two essential problems in Computer Algebra, namely polynomial factorization and polynomial greatest common divisor computation, can be efficiently solved thanks to multiple polynom…
Resolving zero-divisors using Hensel lifting
John Kluesner, Michael Monagan
Algorithms which compute modulo triangular sets must respect the presence of zero-divisors. We present Hensel lifting as a tool for dealing with them. We give an application: a mod…
Some results on counting roots of polynomials and the Sylvester resultant
Michael Monagan, Baris Tuncer
We present two results, the first on the distribution of the roots of a polynomial over the ring of integers modulo and the second on the distribution of the roots of the Sylve…
A Modular Algorithm for Computing Polynomial GCDs over Number Fields presented with Multiple Extensions
Mark van Hoeij, Michael Monagan
We consider the problem of computing the monic gcd of two polynomials over a number field L = Q(alpha_1,...,alpha_n). Langemyr and McCallum have already shown how Brown's modular G…
A new edge selection heuristic for computing the Tutte polynomial of an undirected graph
Michael Monagan
We present a new edge selection heuristic and vertex ordering heuristic that together enable one to compute the Tutte polynomial of much larger sparse graphs than was previously do…