8 citations · 17 across the 8 of their papers we have counts for
Showing 2024 · cs.SCShow all
2 papers · 2 filters
cs.SC2024★ 1 cited
On the arithmetic complexity of computing Gröbner bases of comaximal determinantal ideals
Sriram Gopalakrishnan
Let be an matrix of homogeneous linear forms over a field . If the ideal generated by minors of size is Cohen-Macaulay, then the…
cs.SC2024
Optimized Gröbner basis algorithms for maximal determinantal ideals and critical point computations
Sriram Gopalakrishnan, Vincent Neiger, Mohab Safey El Din
Given polynomials and , all in for some field , we consider the problem of computing the critical points of the restriction of …