Polynomial Euclidean Algorithm

The Polynomial Euclidean Algorithm is a variant of the Euclidean Algorithm that operates on polynomials over a field, using polynomial division to iteratively compute the greatest common divisor of two polynomials by reducing the degree of remainders until zero is obtained.

27

Publications

1.2K

Citations

44

Authors

22

Institutions

Publications per year

2017–2026

1

Authors

44

  1. MK
    Michael Kalkbrener

    École Polytechnique Fédérale de Lausanne, Switzerland

    1 publications · 199 citations

    1

    h-index

  2. DA
    D. A. Thomas

    The University of Melbourne, Australia

    1 publications · 23 citations

    1

    h-index

  3. RC
    R. C. Mullin

    University of Waterloo, Canada

    1 publications · 71 citations

    1

    h-index

  4. HZ
    Hanlin Zhang

    Xi'an Jiaotong University, China

    1 publications · 33 citations

    1

    h-index

  5. MM
    Marc Moreno Maza

    Western University, Canada

    1 publications · 15 citations

    1

    h-index

1–5 of 44

Venues

  1. Choice Reviews Online

    CRO · 3 publications · 411 citations

    3

    h-index

  2. Journal of Symbolic Computation

    3 publications · 250 citations

    3

    h-index

  3. American Mathematical Monthly

    2 publications · 49 citations

    2

    h-index

  4. Journal of Mathematical Physics

    1 publications · 17 citations

    1

    h-index

  5. Journal of Physics Conference Series

    1 publications · 15 citations

    1

    h-index

1–5