Factoring polynomials over finite fields: Asymptotic complexity vs. reality

Several algorithms for factoring polynomials over nite elds are compared from the point of view of asymptotic complexity, and from a more realistic point of view: how well actual implementations perform on \moderately" sized inputs.