Cited in
(27)- A computational algebraic geometry approach to enumerate Malcev magma algebras over finite fields
- Signature-based algorithms to compute Gröbner bases
- Constructive \(D\)-module theory with \texttt{Singular}
- Attacking Bivium Using SAT Solvers
- Computing Boolean Gröbner bases within linear algebra
- A survey on signature-based algorithms for computing Gröbner bases
- Computing Gröbner Bases within Linear Algebra
- Counting and enumerating feasible rotating schedules by means of Gröbner bases
- Ideal Turaev-Viro invariants
- FGb
- PolyBoRi
- Felix
- BERGMAN
- Kan
- MAS
- GBLA
- Sparse Gröbner bases: the unmixed case
- pls.lib
- New developments in the theory of Gröbner bases and applications to formal verification
- Obtaining and solving systems of equations in key variables only for the small variants of AES
- Algebraic attacks on the Courtois toy cipher
- Optimising Gröbner bases on Bivium
- Computing inhomogeneous Gröbner bases
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials
- G2V.mpl
- \textsc{Plural}, a non-commutative extension of \textsc{Singular}: past, present and future.
- Algebraic geometry and Bethe ansatz. I: The quotient ring for BAE
This page was built for software: slimgb
