On the construction of staggered linear bases
From MaRDI portal
Publication:5157738
DOI10.1142/S0219498821501322zbMath1479.13033MaRDI QIDQ5157738
Amir Hashemi, Masoumeh Javanbakht
Publication date: 20 October 2021
Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)
Gröbner bases; polynomial ring; Buchberger's algorithm; signature-based algorithm; staggered linear bases
68W30: Symbolic computation and algebraic computation
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
Related Items
Cites Work
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- A survey on signature-based algorithms for computing Gröbner bases
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- A new framework for computing Gröbner bases
- Solving Polynomial Equation Systems
- Using Algebraic Geometry
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item