A signature-based algorithm for computing Gröbner bases in solvable polynomial algebras
From MaRDI portal
Publication:5244556
DOI10.1145/2442829.2442879zbMath1308.68193OpenAlexW1979661810MaRDI QIDQ5244556
Yao Sun, Yang Zhang, Ding-Kang Wang, Xiao-Dong Ma
Publication date: 27 March 2015
Published in: Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2442829.2442879
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (10)
Signature Gröbner bases, bases of syzygies and cofactor reconstruction in the free algebra ⋮ A new framework for computing Gröbner bases ⋮ A signature-based algorithm for computing Gröbner-Shirshov bases in skew solvable polynomial rings. ⋮ A new proof for the correctness of the F5 algorithm ⋮ Computing coupled border bases ⋮ Signature Gröbner bases in free algebras over rings ⋮ Axioms for a theory of signature bases ⋮ A survey on signature-based algorithms for computing Gröbner bases ⋮ Speeding up the GVW algorithm via a substituting method ⋮ An improvement over the GVW algorithm for inhomogeneous polynomial systems
Uses Software
This page was built for publication: A signature-based algorithm for computing Gröbner bases in solvable polynomial algebras
