Solving degree, last fall degree, and related invariants

Journal of Symbolic Computation(2023)

引用 6|浏览6
暂无评分
摘要
In this paper we study and relate several invariants connected to the solving degree of a polynomial system. This provides a rigorous framework for estimating the complexity of solving a system of polynomial equations via Gröbner bases methods. Our main results include a connection between the solving degree and the last fall degree and one between the degree of regularity and the Castelnuovo–Mumford regularity.
更多
查看译文
关键词
13P10,13P15,13P25,68W30
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要