A new efficient algorithm for computing Gröbner bases (F4)
- 1 June 1999
- journal article
- Published by Elsevier in Journal of Pure and Applied Algebra
- Vol. 139 (1-3) , 61-88
- https://doi.org/10.1016/s0022-4049(99)00005-5
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Design of regular nonseparable bidimensional wavelets using Grobner basis techniquesIEEE Transactions on Signal Processing, 1998
- Parallel Sparse LU Decomposition on a Mesh Network of TransputersSIAM Journal on Matrix Analysis and Applications, 1993
- On an installation of Buchberger's algorithmJournal of Symbolic Computation, 1988
- Solving sparse linear equations over finite fieldsIEEE Transactions on Information Theory, 1986
- Gröbner Bases: An Algorithmic Method in Polynomial Ideal TheoryPublished by Springer Nature ,1985
- The Multifrontal Solution of Unsymmetric Sets of Linear EquationsSIAM Journal on Scientific and Statistical Computing, 1984
- Exact solution of linear equations usingP-adic expansionsNumerische Mathematik, 1982
- Resolution des systemes d'equations algebriquesTheoretical Computer Science, 1981
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen GleichungssystemsAequationes mathematicae, 1970
- Shift-register synthesis and BCH decodingIEEE Transactions on Information Theory, 1969