Root-finding algorithm for univariate polynomials with coefficients from k[x,y]

Бесплатный доступ

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].

Короткий адрес: https://sciup.org/14249127

IDR: 14249127

Статья научная