求有限域的极小多项式的搜索算法

A SEARCHING ARITHMETIC OF MINIMUM POLYNOMIAL IN FINITE COMMUTATIVE FIELD

给出了求一个有限域的极小多项式的搜索算法,并由此算法求出了一类有限域,它们具有相同的极小多项式,并讨论了算法复杂性。

In this paper,a searching arithmetic about minimum polynomial of a finite commutative field is given. Using the arithmetic, a sort of finite commutative fields is found, which have the same form minimum polynomial. The complexity of the arithmetic is discussed.