Multivariate Polynomial Gcd

Multivariate Polynomial Gcd is a mathematical algorithm that extends the Euclidean Algorithm to compute the greatest common divisor of two or more polynomials in multiple variables over a unique factorization domain, distinguished by its capability to handle multivariate structures through recursive or modular reduction techniques.

35

Publications

1.3K

Citations

52

Authors

33

Institutions

Publications per year

2017–2026

1

Variants

Multivariate Polynomial Greatest Common Divisor

Authors

52

  1. JV
    Joachim von zur Gathen

    University of Toronto, Canada

    3 publications · 137 citations

    3

    h-index

  2. TS
    Tateaki Sasaki

    University of Tsukuba, Japan

    3 publications · 53 citations

    3

    h-index

  3. LZ
    Lihong Zhi

    Chinese Academy of Agricultural Mechanization Sciences, China

    3 publications · 124 citations

    3

    h-index

  4. VY
    Victor Y. Pan

    Lehman College, United States

    3 publications · 122 citations

    3

    h-index

  5. EK
    Erich Kaltofen

    North Carolina State University, United States

    2 publications · 120 citations

    2

    h-index

1–5 of 52

Venues

  1. Journal of Symbolic Computation

    3 publications · 45 citations

    3

    h-index

  2. 2

    h-index

  3. ACM SIGSAM Bulletin

    2 publications · 59 citations

    2

    h-index

  4. SIAM Journal on Computing

    1 publications · 99 citations

    1

    h-index

  5. Information and Computation

    1 publications · 82 citations

    1

    h-index

1–5