A new signature-based algorithms for computing Gröbner bases

DOI10.1007/s11424-015-2260-zzbMath1327.68342OpenAlexW1971329974MaRDI QIDQ2341616

Dong-Mei Li, Licui Zheng, Jin-wang Liu, Wei-jun Liu

Publication date: 27 April 2015

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-015-2260-z

zbMATH Keywords

Gröbner basisfactorsignature-based

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (1)

Some improvements for the algorithm of Gröbner bases over dual valuation domain

Uses Software

• F5C

Cites Work

• The F5 algorithm in Buchberger's style
• A new proof for the correctness of the F5 algorithm
• F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Generalization of the F5 algorithm for calculating Gröbner bases for polynomial ideals
• A new incremental algorithm for computing Groebner bases
• A generalized criterion for signature related Gröbner basis algorithms
• Advances in Cryptology - CRYPTO 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new signature-based algorithms for computing Gröbner bases