Нашли опечатку? Выделите ее мышкой и нажмите Ctrl+Enter
Название: Irreducible polynomials theory
Автор: Filaseta M.
Аннотация:
The choice of topics will depend on students' interests. Some of the possible topics include Risenstein's criterion. Newton polygons, ineducibility criteria, finite fields, factoring algorithms, density results, cyclotomic polynomials, other special polynomials, Capelli's theorem, covering problems, Hilbert's irreducibility theorem, sieve methods, and "almost" prime values of polynomials.