LMS Durham Symposium on Computational Number Theory
24 July - 3 August 2000


Fast absolute irreducibility testing for sparse polynomials

Alan LAUDER (Oxford)

Abstract: An algorithm for testing n-variable polynomials over arbitrary fields for absolute irreducibility will be presented. The algorithm, though heuristic, is especially effective for sparse polynomials with n>2. A "typical" polynomial with a few hundred terms will be checked to be absolutely irreducible in seconds.


Back to Symposium programme page
Page maintained by John Cremona: John.Cremona@nottingham.ac.uk