A new efficient algorithm for computing Gröbner bases without reduction to zero (F5)

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2002, Pages 75-83

  Faugère, Jean Charles ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEQUENCES; BOOLEAN ALGEBRA; LINEAR ALGEBRA; OPTIMIZATION; PROBLEM SOLVING;

BUCHBERGER CRITERIA; GROBNER BASES; SYLVESTER MATRIX; TRIANGULARIZATION;

ALGORITHMS;

EID: 0036045901     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780506.780516     Document Type: Conference Paper

References (11)

1. A criterion for detecting unnecessary reductions in the construction of Gröbner basis
2. Gröbner bases : An algorithmic method in polynomial ideal theory
3. A new efficient algorithm for computing Gröbner bases (F4)
4. Buchberger's algorithm and staggered linear bases
5. Gaussian elimination and resolution of systems of algebraic equations
6. Gröbner bases computation using syzygies
7. Involutive bases of polynomial ideals