2 citations · 2 across the 1 of their papers we have counts for
3 papers
cs.DC2020
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…
cs.SC2018
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…
cs.DM2012★ 2 cited
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…