An analysis of the Krönecker algorithm for factorization of algebraic polynomials
We give an analysis of the Krönecker algorithm for factoring polynomials over algebraic extension fields. An elementary proof of correctness and improvements by B. Trager and P. Weigel are discussed. The computing time analysis is given in terms of the computing time to factor integral polynomials which is asymptotically the main contribution to the total time. Empirically, however, the time for the gcd of the algebraic polynomials contributes often most of the total time.