Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases (Q2204858)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases
scientific article

    Statements

    Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases (English)
    0 references
    0 references
    0 references
    16 October 2020
    0 references
    The authors of the paper under review gives an upper bound to the degree of regularity for an overdetermined system of forms of the same degree with coefficients in a finite field. This allowes them to show that almost all sufficiently overdetermined systems of polynomial equations over finite fields of the same degree are solvable in polynomial time.
    0 references
    0 references
    polynomial equation systems
    0 references
    finite fields
    0 references
    Macaulay matrices
    0 references
    Groebner bases
    0 references
    multisets
    0 references
    complexity
    0 references

    Identifiers