ROOT-FINDING ALGORITHM FOR UNIVARIATE POLYNOMIALS WITH COEFFICIENTS FROM K[X,Y]

Abstract

Deterministic polynomial-time root-finding algorithm for univariate polynomials with coefficients from k[x,y] where k is a field of any characteristic is constructed. Our algorithm can be viewed as an extension of the Roth-Ruckenstein's root-finding algorithm to polynomials from k[x,y][T].

Keywords

• корни многочленов
• алгоритм рота-рукенштейна
• факторизация многочленов
• линейные делители
• конечные поля