Computing with polynomials given by straight-line programs II sparse factorization
暂无分享,去创建一个
[1] Erich Kaltofen. Computing with polynomials given by straight-line programs I: greatest common divisors , 1985, STOC '85.
[2] Erich Kaltofen. Sparse Hensel Lifting , 1985, European Conference on Computer Algebra.
[3] J. Gathen,et al. Factorization of multivariate polynomials over finite fields , 1985 .
[4] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[5] K. Ramachandra,et al. Vermeidung von Divisionen. , 1973 .
[6] Joachim von zur Gathen,et al. Irreducibility of Multivariate Polynomials , 1985, J. Comput. Syst. Sci..
[7] Richard Zippel. Newton's iteration and the sparse Hensel algorithm (Extended Abstract) , 1981, SYMSAC '81.
[8] H. Zassenhaus. On Hensel factorization, I , 1969 .
[9] H. T. Kung,et al. Fast Algorithms for Partial Fraction Decomposition , 1977, SIAM J. Comput..
[10] J. von zur Gathen. Factoring sparse multivariate polynomials , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[11] Paul S. Wang,et al. Factoring multivariate polynomials over the integers , 1973, SIGS.
[12] Erich Kaltofen,et al. Factoring Sparse Multivariate Polynomials , 1983, J. Comput. Syst. Sci..
[13] Arjen K. Lenstra. Factoring Multivariate Polynomials over Finite Fields , 1985, J. Comput. Syst. Sci..
[14] Erich Kaltofen. Effective Hilbert Irreducibility , 1985, Inf. Control..
[15] David R. Musser,et al. Multivariate Polynomial Factorization , 1975, JACM.
[16] Arjen K. Lenstra,et al. Factoring multivariate polynomials over finite fields , 1983, J. Comput. Syst. Sci..
[17] S. Comput,et al. POLYNOMIAL-TIME REDUCTIONS FROM MULTIVARIATE TO BI- AND UNIVARIATE INTEGRAL POLYNOMIAL FACTORIZATION* , 1985 .