Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time

An algorithm of polynomial complexity is described for factoring polynomials in several variables into irreducible factors over a field F which is finitely generated over the prime subfield H. An algorithm is also constructed for finding the components of the protective variety of common roots of homogeneous polynomials (let c−1 denote its dimension) with working time polynomial in. where, the number L is the size of the representation of the polynomials and.