13 citations · 63 across the 21 of their papers we have counts for
1 paper · 1 filter
Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
We study the complexity of solving the \emph{generalized MinRank problem}, i.e. computing the set of points where the evaluation of a polynomial matrix has rank at most r. A natu…