Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
暂无分享,去创建一个
[1] I. Shafarevich. Basic algebraic geometry , 1974 .
[2] Two reductions of graph isomorphism to problems on polynomials , 1982 .
[3] Relation between rank and multiplicative complexity of a bilinear form over a commutative Noetherian ring , 1981 .
[4] George E. Collins,et al. Subresultants and Reduced Polynomial Remainder Sequences , 1967, JACM.
[5] D. Grigor'ev,et al. Factorization of polynomials over a finite field and the solution of systems of algebraic equations , 1986 .
[6] D. Lazard. Algèbre linéaire sur $K[X_1,\dots,X_n]$ et élimination , 1977 .
[7] Erich Kaltofen,et al. A polynomial reduction from multivariate to bivariate integral polynomial factorization. , 1982, STOC '82.
[8] Erich Kaltofen. A Polynomial-Time Reduction from Bivariate to Univariate Integral Polynomial Factorization , 1982, FOCS.
[9] A. Seidenberg. CONSTRUCTIONS IN A POLYNOMIAL RING OVER THE RING OF INTEGERS. , 1978 .
[10] Dima Grigoriev. Multiplicative Complexity of a Bilinear Form over a Commutative Ring , 1981, MFCS.
[11] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[12] D. LAZARD. Commutative Algebra and Computer Algebra , 1982, EUROCAM.
[13] Daniel Lazard,et al. Resolution des Systemes d'Equations Algebriques , 1981, Theor. Comput. Sci..
[14] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .