A note on Gröbner bases and Berlekamp's algorithm

DOI10.1016/j.amc.2007.05.038zbMath1137.13019OpenAlexW1999205805MaRDI QIDQ2474859

Manuel Avelino Insua Hermo, Manuel Ladra Gonzalez

Publication date: 6 March 2008

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.05.038

zbMATH Keywords

Gröbner basesfinite fieldsfactorization of polynomialssquare-free polynomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Finite fields (field-theoretic aspects) (12E20)

Uses Software

• Maple

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ideal basis and primary decompositions: case of two variables
• A note on Gröbner bases and integration of rational functions
• Computing Frobenius maps and factoring polynomials
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases
• Subquadratic-time factoring of polynomials over finite fields
• Factoring Polynomials Over Large Finite Fields

This page was built for publication: A note on Gröbner bases and Berlekamp's algorithm