Journal of Symbolic Computation
On an installation of Buchberger's algorithm
Journal of Symbolic Computation
“One sugar cube, please” or selection strategies in the Buchberger algorithm
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Risa/Asir—a computer algebra system
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
A dynamic algorithm for Gröbner basis computation
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Efficient computation of zero-dimensional Gro¨bner bases by change of ordering
Journal of Symbolic Computation
Hilbert functions and the Buchberger algorithm
Journal of Symbolic Computation
The MAGMA algebra system I: the user language
Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Converting bases with the Gröbner walk
Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
Gröbner-Bases, Gaussian elimination and resolution of systems of algebraic equations
EUROCAL '83 Proceedings of the European Computer Algebra Conference on Computer Algebra
A new efficient algorithm for computing Gröbner bases without reduction to zero (F5)
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Term cancellations in computing floating-point Gröbner bases
CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing
| Hi-index | 0.00 |
In this paper, we present an alternative algorithm to compute Gröbner bases, which is based on computations on sparse linear algebra. Both of S-polynomial computations and monomial reductions are computed in linear algebra simultaneously in this algorithm. So it can be implemented to any computational system which can handle linear algebra. For a given ideal in a polynomial ring, it calculates a Gröbner basis along with the corresponding term order appropriately.