Applying IsRewritten criterion on Buchberger algorithm
From MaRDI portal
Publication:638523
DOI10.1016/j.tcs.2011.04.040zbMath1221.68299OpenAlexW1994052350MaRDI QIDQ638523
Benyamin M.-Alizadeh, Amir Hashemi
Publication date: 12 September 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.04.040
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Software, source code, etc. for problems pertaining to computer science (68-04)
Related Items (4)
Computing comprehensive Gröbner systems: a comparison of two methods ⋮ Invariant \(\mathrm G^2\mathrm V\) algorithm for computing SAGBI-Gröbner bases ⋮ On the use of Buchberger criteria in \(\mathrm G^2\mathrm V\) algorithm for calculating Gröbner bases ⋮ Isrewritten.mpl
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extended \(F_5\) criteria
- F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
- On an installation of Buchberger's algorithm
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- A new incremental algorithm for computing Groebner bases
This page was built for publication: Applying IsRewritten criterion on Buchberger algorithm