Modular algorithms for computing Gröbner bases
Author:
- 1 April 2003
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 35 (4) , 403-419
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Upper and lower bounds for the degree of Groebner bases2005
- On Lucky PrimesJournal of Symbolic Computation, 1993
- On lucky ideals for Gröbner basis computationsJournal of Symbolic Computation, 1992
- Gröbner trace algorithms1989
- On an installation of Buchberger's algorithmJournal of Symbolic Computation, 1988
- Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory1985
- Some comments on the modular approach to Gröbner-basesACM SIGSAM Bulletin, 1983
- Mapping integers and hensel codes onto Farey fractionsBIT Numerical Mathematics, 1983
- A criterion for detecting unnecessary reductions in the construction of Gröbner-bases1979
- Exact solutions of linear equations with rational coefficients by congruence techniquesMathematics of Computation, 1966