Resultant Computation
Resultant Computation is a symbolic algebraic method in computational number theory that calculates the resultant of two polynomials, a scalar value defined as the determinant of the Sylvester matrix, to determine their greatest common divisor and common root structure.
213
Publications
7.6K
Citations
279
Authors
166
Institutions
Publications per year
2017–2026
11
Parents
213
Subresultants and Reduced Polynomial Remainder Sequences
George E. Collins · Journal of the ACM · 1967 · 330 citations
F. S. Macaulay · Proceedings of the London Mathematical Society · 1902 · 271 citations
On the Newton Polytope of the Resultant
Bernd Sturmfels · Journal of Algebraic Combinatorics · 1994 · 241 citations · Full text
1–5 of 213
279
National and Kapodistrian University of Athens, Greece
12 publications · 599 citations
11
h-index
7
h-index
7
h-index
7
h-index
6
h-index
1–5 of 279
166
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
14 h-index
30 publications
1.2K citations

Rice University
Houston, United States
11 h-index
14 publications
397 citations
University of California, Berkeley
Berkeley, United States
11 h-index
17 publications
945 citations
National University of Singapore
Singapore, Singapore
9 h-index
10 publications
290 citations

Chinese Academy of Sciences
Beijing, China
8 h-index
17 publications
384 citations

National and Kapodistrian University of Athens
Athens, Greece
7 h-index
9 publications
229 citations
University of Sheffield
Sheffield, United Kingdom
6 h-index
8 publications
147 citations
Universidad de Buenos Aires
Buenos Aires, Argentina
6 h-index
8 publications
401 citations
1–8 of 166
28 publications · 879 citations
18
h-index
10 publications · 203 citations
10
h-index
PROC · 6 publications · 191 citations
6
h-index
5 publications · 165 citations
5
h-index
TOG · 4 publications · 147 citations
4
h-index
1–5