Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. A. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
2. W. S. Brown. On Euclid's algorithm and the computation of polynomial greatest common divisors. Journal of the ACM, 18(4):478–504, October 1971.
3. D. G. Cantor and E. Kaltofen. Fast multiplication over arbitrary rings. 1986. Manuscript.
4. B. W. Char, K. O. Geddes, and G. H. Gonnet. Gcdheu: heuristic polynomials gcd algorithm based on integer gcd computation. In Proc. EUROSAM '84, pages 285–296, Springer-Verlag, 1984. Lecture Notes in Computer Science 174.
5. G. E. Collins. The calculation of multivariate polynomial resultants. Journal of the ACM, 18:515–532, 1971.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Algorithms for a multiple algebraic extension II;Applied Algebra, Algebraic Algorithms and Error-Correcting Codes;1991