Computing border bases using mutant strategies

DOI10.1134/S0965542514010163zbMath1313.13040OpenAlexW1968497634MaRDI QIDQ2940363

No author found.

Publication date: 26 January 2015

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542514010163

zbMATH Keywords

mutant strategiescomputing border basesimproved border basis algorithm

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)

Uses Software

• M4RI
• Magma
• ApCoCoA
• MXL3
• MutantXL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the relation between the MXL family of algorithms and Gröbner basis algorithms
• Approximate computation of zero-dimensional polynomial ideals
• Computing border bases
• Stable border bases for ideals of points
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• The Magma algebra system. I: The user language
• Characterizations of border bases
• Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
• Subideal border bases
• MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy
• Flexible Partial Enlargement to Accelerate Gröbner Basis Computation over $\mathbb{F}_2$
• MXL3: An Efficient Algorithm for Computing Gröbner Bases of Zero-Dimensional Ideals
• An Application of Möller’s Algorithm to Coding Theory
• Algebraic Attacks Galore!
• Border basis representation of a general quotient algebra

This page was built for publication: Computing border bases using mutant strategies