Algorithms For Ideals

Algorithms for Ideals is a computational framework within computational algebra that systematically solves problems related to polynomial ideals through algorithmic methods such as Gröbner basis computation, ideal membership testing, and decomposition of algebraic varieties.

235

Publications

12.8K

Citations

351

Authors

230

Institutions

Publications per year

2017–2026

16

Authors

351

  1. BB
    Bruno Buchberger

    Johannes Kepler University of Linz, Austria

    6 publications · 1.9K citations

    6

    h-index

  2. DK
    Deepak Kapur

    University of New Mexico, United States

    4 publications · 275 citations

    4

    h-index

  3. EM
    Ernst Mayr

    Harvard University, United States

    4 publications · 613 citations

    4

    h-index

  4. PD
    Pratulananda Das

    Jadavpur University, India

    4 publications · 230 citations

    4

    h-index

  5. JF
    Jean‐Charles Faugère

    Sorbonne Université, France

    3 publications · 116 citations

    3

    h-index

1–5 of 351

Venues

  1. Journal of Symbolic Computation

    27 publications · 2K citations

    18

    h-index

  2. Mathematics of Computation

    MCOM · 12 publications · 307 citations

    11

    h-index

  3. Journal of Algebra

    10 publications · 395 citations

    10

    h-index

  4. Transactions of the American Mathematical Society

    TRAN · 7 publications · 569 citations

    7

    h-index

  5. Communications in Algebra

    7 publications · 145 citations

    7

    h-index

1–5