The complexity of MinRank
In this note, we leverage some of our results from arXiv:1706.06319 to produce a concise and rigorous proof for the complexity of the generalized MinRank Problem in the under-defined and well-defined case. Our main theorem recovers and extends previous results by Faugere, Safey El Din, Spaenlehauer (arXiv:1112.4411).