Solving degree, last fall degree, and related invariants

12/10/2021
by   Alessio Caminata, et al.
0

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 Groebner 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/02/2020

Stronger bounds on the cost of computing Groebner bases for HFE systems

We give upper bounds for the solving degree and the last fall degree of ...
research
10/10/2022

Solving polynomial equations and applications

These notes accompany an introductory lecture given by the author at the...
research
07/29/2020

Formal Power Series on Algebraic Cryptanalysis

In cryptography, attacks that utilize a Gröbner basis have broken severa...
research
09/07/2023

The complexity of solving a random polynomial system

A multivariate cryptograpic instance in practice is a multivariate polyn...
research
07/07/2016

Finding binomials in polynomial ideals

We describe an algorithm which finds binomials in a given ideal I⊂Q[x_1,...
research
07/31/2017

Rational invariants of ternary forms under the orthogonal group

In this article we determine a generating set of rational invariants of ...
research
05/04/2020

Complexity of Sparse Polynomial Solving 2: Renormalization

Renormalized homotopy continuation on toric varieties is introduced as a...

Please sign up or login with your details

Forgot password? Click here to reset