Probabilistic algorithms for sparse polynomials
暂无分享,去创建一个
[1] H. Zassenhaus. On Hensel factorization, I , 1969 .
[2] W. S. Brown. On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors , 1971, JACM.
[3] David Y. Y. Yun,et al. The EZ GCD algorithm , 1973, ACM Annual Conference.
[4] David Y. Y. Yun,et al. The Hensel Lemma in Algebraic Manipulation , 1973, Outstanding Dissertations in the Computer Sciences.
[5] David R. Musser,et al. Multivariate Polynomial Factorization , 1975, JACM.
[6] Paul S. Wang,et al. Factoring multivariate polynomials over the integers , 1973, SIGS.
[7] Joseph F. Traub,et al. Algorithms and Complexity: New Directions and Recent Results , 1976 .
[8] Volker Strassen,et al. A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..
[9] Paul S. Wang. An improved multivariate polynomial factoring algorithm , 1978 .