GVW algorithm over principal ideal domains

DOI10.1007/s11424-013-2130-5zbMath1302.68332OpenAlexW2161736272MaRDI QIDQ2440326

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

Publication date: 18 March 2014

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

Full work available at URL: https://doi.org/10.1007/s11424-013-2130-5

zbMATH Keywords

Gröbner basisprincipal ideal domainBuchberger's algorithmF5 algorithmGVW algorithm

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

On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra ⋮ An involutive GVW algorithm and the computation of Pommaret bases

Uses Software

• F5C

Cites Work

• Extended \(F_5\) criteria
• 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)\)
• Strong Gröbner bases for polynomials over a principal ideal ring
• A new incremental algorithm for computing Groebner bases
• A generalized criterion for signature related Gröbner basis algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item