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
Parents
35
A subdivision-based algorithm for the sparse resultant
John Canny, Ioannis Z. Emiris · Journal of the ACM · 2000 · 107 citations · Full text
Parallel Algorithms for Algebraic Problems
Joachim von zur Gathen · SIAM Journal on Computing · 1984 · 99 citations
Robert T. Moenck · 1973 · 87 citations
1–5 of 35
52
3
h-index
3
h-index
Chinese Academy of Agricultural Mechanization Sciences, China
3 publications · 124 citations
3
h-index
3
h-index
2
h-index
1–5 of 52
33
City University of New York
New York, United States
3 h-index
3 publications
122 citations

University of Toronto
Toronto, Canada
2 h-index
2 publications
124 citations
Simon Fraser University
Burnaby, Canada
2 h-index
3 publications
67 citations
University of Tsukuba
Tsukuba, Japan
1 h-index
2 publications
24 citations
Board of the Swiss Federal Institutes of Technology
Zurich, Switzerland
1 h-index
1 publications
10 citations
Vrije Universiteit Brussel
Brussels, Belgium
1 h-index
2 publications
26 citations
Massachusetts Institute of Technology
Cambridge, United States
1 h-index
1 publications
88 citations
Rensselaer Polytechnic Institute
Troy, United States
1 h-index
1 publications
32 citations
1–8 of 33
3 publications · 45 citations
3
h-index
2 publications · 42 citations
2
h-index
2 publications · 59 citations
2
h-index
1 publications · 99 citations
1
h-index
1 publications · 82 citations
1
h-index
1–5