发表机构
Beijing Institute of Mathematical Sciences and Applications; Tsinghua University（北京国际数学研究中心; 清华大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本文研究MinRank问题的三种代数模型（子式、Kipnis-Shamir和支持子式）之间的关系，揭示其等价性与差异，深化代数结构理解，助力高效算法研究。
AI 中文摘要
本文研究了MinRank问题（一个著名的NP难问题）的代数模型之间的关系。我们在子式建模、Kipnis-Shamir建模和支持子式建模之间建立了联系，深入揭示了它们的等价性与差异性。我们的结果有助于更深入地理解MinRank问题背后的代数结构，并可能为未来求解该问题的高效算法研究提供参考。
英文摘要
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.
Comments12 pages,1 figures
