On the Computation of Elimination Ideals of Boolean Polynomial Rings
From MaRDI portal
Publication:3598007
Recommendations
Cites work
- scientific article; zbMATH DE number 3501560 (Why is no real title available?)
- scientific article; zbMATH DE number 1262465 (Why is no real title available?)
- A new algorithm for discussing Gröbner bases with parameters.
- A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- An alternative approach to comprehensive Gröbner bases
- Boolean Gröbner bases
- Comprehensive Gröbner bases
- Gröbner bases for polynomial ideals over commutative regular rings
- Improving the DISPGB algorithm using the discriminant ideal
Cited in
(7)- Boolean ideals and their varieties
- Elimination theory for addition and the frobenius map in polynomial rings
- Gröbner bases for polynomial systems with parameters
- Ideal-specific elimination orders form a star-shaped region
- On computation of Boolean involutive bases
- Boolean Gröbner bases
- On the Computation of Comprehensive Boolean Gröbner Bases
This page was built for publication: On the Computation of Elimination Ideals of Boolean Polynomial Rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3598007)