activity
20122020
most citedA new edge selection heuristic for computing the Tutte polynomial of an undirected graph

2 citations · 2 across the 3 of their papers we have counts for

collaborators
Showing 2016Show all

2 papers · 1 filter

math.CO2016

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…

cs.SC2016

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…