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
Parents
235
1–5 of 235
351
6
h-index
4
h-index
4
h-index
4
h-index
3
h-index
1–5 of 351
230

Centre National de la Recherche Scientifique
Paris, France
10 h-index
14 publications
413 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
9 h-index
10 publications
290 citations
Purdue University West Lafayette
West Lafayette, United States
7 h-index
9 publications
387 citations

Johannes Kepler University of Linz
Linz, Austria
6 h-index
9 publications
827 citations

Sorbonne Université
Paris, France
6 h-index
8 publications
343 citations
University of Kaiserslautern
Kaiserslautern, Germany
5 h-index
8 publications
287 citations
RWTH Aachen University
Aachen, Germany
5 h-index
6 publications
122 citations

University of Duisburg-Essen
Essen, Germany
4 h-index
7 publications
488 citations
1–8 of 230
27 publications · 2K citations
18
h-index
MCOM · 12 publications · 307 citations
11
h-index
10 publications · 395 citations
10
h-index
TRAN · 7 publications · 569 citations
7
h-index
7 publications · 145 citations
7
h-index
1–5