Work

On the relations among algebraic models for the MinRank problem

Year: 2026

Type: preprint

Abstract: In this article, we study the relations between algebraic models for the MinRank problem, which is a well-known NP-hard problem. We establish connections between the minors modeling, the Kipnis-Shamir modeling, and the support minors modeling, providing insights into their equivalences and differences. Our results contribute to a deeper understanding of the algebraic structures underlying the MinRank problem and may inform future research on efficient algorithms for solving it.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2609.07223

Authors: Li, Peigen, Tao, Siyong

Language: English

Topic: Polynomial and algebraic computation

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: National Natural Science Foundation of China

OpenAlex ID: W7212031978

Cites:

Cited by:

Related to: 10