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

Authors

279

  1. IZ
    Ioannis Z. Emiris

    National and Kapodistrian University of Athens, Greece

    12 publications · 599 citations

    11

    h-index

  2. RG
    Ron Goldman

    Rice University, United States

    7 publications · 171 citations

    7

    h-index

  3. DK
    Deepak Kapur

    University of New Mexico, United States

    7 publications · 297 citations

    7

    h-index

  4. EC
    Eng-Wee Chionh

    National University of Singapore, Singapore

    7 publications · 197 citations

    7

    h-index

  5. JC
    John Canny

    University of California, Berkeley, United States

    6 publications · 442 citations

    6

    h-index

1–5 of 279

Venues

  1. Journal of Symbolic Computation

    28 publications · 879 citations

    18

    h-index

  2. Linear Algebra and its Applications

    10 publications · 203 citations

    10

    h-index

  3. Proceedings of the American Mathematical Society

    PROC · 6 publications · 191 citations

    6

    h-index

  4. Journal of Pure and Applied Algebra

    5 publications · 165 citations

    5

    h-index

  5. ACM Transactions on Graphics

    TOG · 4 publications · 147 citations

    4

    h-index

1–5