A Polynomial-Time Reduction from Bivariate to Univariate Integral Polynomial Factorization
暂无分享,去创建一个
[1] Erich Kaltofen,et al. On the complexity of factoring polynomials with integer coefficients , 1982 .
[2] Paul S. Wang. An improved multivariate polynomial factoring algorithm , 1978 .
[3] Joseph F. Traub,et al. On Euclid's Algorithm and the Theory of Subresultants , 1971, JACM.
[4] Paul S. Wang,et al. New Algorithms for Polynomial Square-Free Decomposition Over the Integers , 1979, SIAM J. Comput..
[5] A. O. Gelʹfond. Transcendental and Algebraic Numbers , 1960 .
[6] M. Mignotte. An inequality about factors of polynomials , 1974 .
[7] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[8] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.
[9] Pierre Samuel,et al. Algebraic theory of numbers , 1971 .
[10] Peter J. Weinberger,et al. Factoring Polynomials Over Algebraic Number Fields , 1976, TOMS.
[11] Donald E. Knuth,et al. The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .
[12] David R. Musser,et al. Multivariate Polynomial Factorization , 1975, JACM.