An asymptotically fast probabilistic algorithm for computing polynomial GCD's over an algebraic number field

  • Lars Langemyr
Submitted Contributions Computational Algebra And Geometry
Part of the Lecture Notes in Computer Science book series (LNCS, volume 508)


We give a probabilistic algorithm for computing the greatest common divisor (GCD) of two polynomials over an algebraic number field. We can compute the GCD using O(llog5(l)) expected binary operations where l is the size of the GCD given by standard estimations. Since we require time Ω(l) just to write down the GCD, the algorithm is close to optimal.


Finite Field Binary Operation Algebraic Number Great Common Divisor Probabilistic Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.Google Scholar
  2. [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.Google Scholar
  3. [3]
    D. G. Cantor and E. Kaltofen. Fast multiplication over arbitrary rings. 1986. Manuscript.Google Scholar
  4. [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.Google Scholar
  5. [5]
    G. E. Collins. The calculation of multivariate polynomial resultants. Journal of the ACM, 18:515–532, 1971.Google Scholar
  6. [6]
    D. Duval. Diverse questions relatives au CALCUL FORMEL AVEC DES NOMBRES ALGÉBRIQUES. PhD thesis, L'université scientifique, technologique, et médicale de Grenoble, Grenoble, April 1987.Google Scholar
  7. [7]
    D. E. Knuth. The Art of Computer Programming II: Seminumerical Algorithms. Addison-Wesley, Reading, Mass., 1981.Google Scholar
  8. [8]
    L. Langemyr. Computing the GCD of two Polynomials Over an Algebraic Number Field. PhD thesis, NADA, Royal Institute of Technology, Stockholm, 1988.Google Scholar
  9. [9]
    L. Langemyr and S. McCallum. The computation of polynomial greatest common divisors over an algebraic number field. J. Symbolic Comp., 8:429–448, 1989.Google Scholar
  10. [10]
    L. Langemyr. An Analysis of the Subresultant Algorithm over an Algebraic Number Field. 1990. Manuscript.Google Scholar
  11. [11]
    R. G. K. Loos. Generalized polynomial remainder sequences. In B. Buchberger, G. E. Collins, and R. G. K. Loos, editors, Computer Algebra, Symbolic and Algebraic Computation, pages 115–137, Springer-Verlag, Wien-New York, 1982.Google Scholar
  12. [12]
    Michael O. Rabin. Probabilistic algorithms for finite fields. SIAM Journal on Computing, 9(2):273–280, May 1980.Google Scholar
  13. [13]
    J. B. Rosser and L. Schoenfeld. Approximate formulas for some functions of prime numbers. Illinois J. Math., 6:64–94, 1962.Google Scholar
  14. [14]
    A. Schönhage. Probabilistic computation of integer polynomial GCDs. J. of Algorithms, 9:365–371, 1988.Google Scholar
  15. [15]
    V. Shoup. On the Deterministic Complexity of Factoring Polynomials over Finite Fields. Technical Report 782, Computer Science Department, University of Wisconsin-Madison, July 1988.Google Scholar
  16. [16]
    T. J. Smedley. A new modular algorithm for computation of algebraic number polynomial Gcds. In Proc. ISSAC '89, pages 91–94, ACM, July 1989.Google Scholar
  17. [17]
    P. J. Weinberger and L. P. Rothschild. Factoring polynomials over algebraic number fields. ACM Transactions on Mathematical Software, 2(4):335–350, December 1976.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Lars Langemyr
    • 1
  1. 1.Wilhelm-Schickard-Institut für InformatikUniversität TübingenTübingenGermany

Personalised recommendations