On the construction of staggered linear bases
From MaRDI portal
Publication:5157738
DOI10.1142/S0219498821501322zbMath1479.13033OpenAlexW3045087520MaRDI QIDQ5157738
Amir Hashemi, Masoumeh Javanbakht
Publication date: 20 October 2021
Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219498821501322
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (3)
Axioms for a theory of signature bases ⋮ A new algorithm for computing staggered linear bases ⋮ Staggered.mpl
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
This page was built for publication: On the construction of staggered linear bases