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 2016 · cs.SCShow all

1 paper · 2 filters

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…