Slimgb: Gröbner bases with slim polynomials

DOI10.1007/s13163-009-0020-0zbMath1200.13044OpenAlexW2033826291MaRDI QIDQ1958670

Michael Brickenstein

Publication date: 4 October 2010

Published in: Revista Matemática Complutense (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13163-009-0020-0

zbMATH Keywords

Gröbner basisF5Buchberger algorithm\texttt{Singular}\texttt{slimbg}Faugere

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items

Attacking Bivium Using SAT Solvers, Optimising Gröbner bases on Bivium, Obtaining and solving systems of equations in key variables only for the small variants of AES, A survey on signature-based algorithms for computing Gröbner bases, Counting and enumerating feasible rotating schedules by means of Gröbner bases, Ideal Turaev-Viro invariants, Algebraic geometry and Bethe ansatz. I: The quotient ring for BAE, Constructive \(D\)-module theory with \texttt{Singular}, slimgb, Computing Gröbner Bases within Linear Algebra, A computational algebraic geometry approach to enumerate Malcev magma algebras over finite fields

Uses Software

• FGb
• Plural
• PolyBoRi
• SINGULAR
• SymbolicData

Cites Work

• The solution of multipoint boundary value problems by the optimal homotopy asymptotic method
• Polybori: A framework for Gröbner-basis computations with Boolean polynomials
• The geobucket data structure for polynomials
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Efficiently computing minimal sets of critical pairs
• SINGULAR
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item