Termination of the F5 algorithm
type: Item
instance of: scholarly article
title: Termination of the F5 algorithm
zbMATH Open document ID: 1323.68598
DOI: 10.1134/S0361768814020042
author: V. V. Galkin
published in: Programming and Computer Software
publication date: 2015-03-23T00:00:00Z
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 13P10
zbMATH DE Number: 6418408
describes a project that uses: F5C
MaRDI profile type: Publication
cites work: Term Rewriting and All That
cites work: Modifying Faugère's F5 algorithm to ensure termination
cites work: F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
cites work: Q4660688
cites work: A new incremental algorithm for computing Groebner bases
cites work: Extended \(F_5\) criteria
cites work: Practical Gröbner basis computation
cites work: The F5 algorithm in Buchberger's style
cites work: Proof of the Faugère criterion for the F5 algorithm
cites work: Generalization of the F5 algorithm for calculating Gröbner bases for polynomial ideals
Recommended article: The termination of the F5 algorithm revisited
Recommended article: Modifying Faugère's F5 algorithm to ensure termination
Recommended article: The F5 algorithm in Buchberger's style
Recommended article: Proof of the Faugère criterion for the F5 algorithm
Recommended article: A new proof for the correctness of the F5 algorithm
Recommended article: A Tropical F5 Algorithm
Recommended article: Five Determinisation Algorithms
Recommended article: Finite termination of the proximal point algorithm
description: scientific article; zbMATH DE number 6418408