most citedAlgorithms for Finding Almost Irreducible and Almost Primitive Trinomials

31 citations · 31 across the 1 of their papers we have counts for

collaborators

1 paper

math.NT2021★ 31 cited

Algorithms for Finding Almost Irreducible and Almost Primitive Trinomials

Richard P. Brent, Paul Zimmermann

Consider polynomials over . We describe efficient algorithms for finding trinomials with large irreducible (and possibly primitive) factors, and give examples of trino…