48 citations · 62 across the 14 of their papers we have counts for
Showing 2026 · cs.SCShow all
2 papers · 2 filters
cs.SC2026
Computing points in connected components defined by a real inequation: algorithms, complexity and implementations, Part I
Jérémy Berthomieu, Edern Gillot, Mohab Safey El Din
We consider the problem of computing sample points in each connected component of a semi-algebraic set defined by the non-vanishing or the positivity of an n-variate polynomial of…
cs.SC2026
Computing submatrices of the Hermite normal form of a structured polynomial matrix
Jérémy Berthomieu, Vincent Neiger, Hugo Passe
Following several decades of successive algorithmic improvements, works from the 2010s have showed how to compute the Hermite normal form (HNF) of a univariate polynomial matrix wi…