Commutative Algebra Algorithms
Commutative Algebra Algorithms is a systematic computational methodology within symbolic computation that specializes in solving problems involving commutative rings, ideals, and modules through algorithmic techniques such as Gröbner basis computation, primary decomposition, and syzygy module construction.
53
Publications
4.3K
Citations
93
Authors
64
Institutions
Publications per year
2017–2026
1
Parents
53
How hard is 3-view triangulation really?
Henrik Stewénius, F. Schaffalitzky, D. Nistér · 2005 · 129 citations
1–5 of 53
93
2
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 93
64
University of California San Diego
San Diego, United States
2 h-index
4 publications
127 citations
University of California, Irvine
Irvine, United States
2 h-index
4 publications
100 citations
Duke University
Durham, United States
2 h-index
2 publications
101 citations

University of Genoa
Genoa, Italy
2 h-index
2 publications
54 citations
University of Illinois Urbana-Champaign
Urbana, United States
1 h-index
3 publications
84 citations
Georgian National Academy of Sciences
Tbilisi, Georgia
1 h-index
1 publications
40 citations
Politecnico di Torino
Turin, Italy
1 h-index
2 publications
28 citations

University of Cape Town
Rondebosch, South Africa
1 h-index
1 publications
40 citations
1–8 of 64
CRO · 4 publications · 2.2K citations
4
h-index
2 publications · 91 citations
2
h-index
TRAN · 2 publications · 45 citations
2
h-index
2 publications · 52 citations
2
h-index
2 publications · 75 citations
2
h-index
1–5