The complexity of MinRank

05/06/2019
by   Alessio Caminata, et al.
0

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 Faugère, Safey El Din, Spaenlehauer (arXiv:1112.4411).

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset