An upper bound for the solving degree in terms of the degree of regularity
From MaRDI portal
Publication:6434405
arXiv2304.13485MaRDI QIDQ6434405FDOQ6434405
Authors: Flavio Salizzoni 
Publication date: 26 April 2023
Abstract: The solving degree is an important parameter for estimating the complexity of solving a system of polynomial equations. In this paper, we provide an upper bound for the solving degree in terms of the degree of regularity. We also show that this bound is optimal. As a direct consequence, we prove an upper bound for the last fall degree and a Macaulay bound.
This page was built for publication: An upper bound for the solving degree in terms of the degree of regularity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6434405)
