Computing border bases using mutant strategies
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2085432 (Why is no real title available?)
- scientific article; zbMATH DE number 4076472 (Why is no real title available?)
- scientific article; zbMATH DE number 1515218 (Why is no real title available?)
- A new efficient algorithm for computing Gröbner bases (F₄)
- Algebraic attacks galore!
- An algebraist's view on border bases
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- An application of Möller's algorithm to coding theory
- Approximate computation of zero-dimensional polynomial ideals
- Border basis representation of a general quotient algebra
- Characterizations of border bases
- Computing border bases
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- Flexible partial enlargement to accelerate Gröbner basis computation over \(\mathbb{F}_2\)
- Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
- MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy
- MXL₃: an efficient algorithm for computing Gröbner bases of zero-dimensional ideals
- On the relation between the MXL family of algorithms and Gröbner basis algorithms
- Stable border bases for ideals of points
- Subideal border bases
- The Magma algebra system. I: The user language
Cited in
(4)
This page was built for publication: Computing border bases using mutant strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2940363)
