Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
复制标题
用于因式分解多项式并在次指数时间内查找簇分量的多项式复杂度算法
DOI：
10.1007/bf01095643
复制
发表时间：
1986
期刊：
影响因子：
--
通讯作者：
A. Chistov
中科院分区：
文献类型：
--
作者：
A. Chistov
本文给出了一个多项式复杂度的算法，用于在素子域H上生成的域F上将多元多项式分解为不可约因子。本文还构造了一个算法，用于求具有工作时间多项式的齐次多项式（c−1表示其维数）的公共根的保护簇的分支。其中，数L是多项式的表示的大小，并且。
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.