The complexity of the SupportMinors Modeling for the MinRank Problem
Daniel Cabarcas, Giulia Gaggero, Elisa Gorla
TL;DR
This paper provides proven estimates for the complexity of SupportMinors Modeling in the MinRank problem, confirming previous heuristic estimates and enhancing understanding of its computational difficulty.
Contribution
It offers rigorous complexity bounds for SupportMinors Modeling, validating earlier heuristic assessments and contributing to the theoretical understanding of the MinRank problem.
Findings
Confirmed heuristic complexity estimates
Provided rigorous complexity bounds
Enhanced theoretical understanding of MinRank
Abstract
In this note, we provide proven estimates for the complexity of the SupportMinors Modeling, mostly confirming the heuristic complexity estimates contained in the original article.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Advanced Graph Theory Research · Constraint Satisfaction and Optimization