On the Computation of Elimination Ideals of Boolean Polynomial Rings
From MaRDI portal
Publication:3598007
DOI10.1007/978-3-540-87827-8_29zbMATH Open1166.13303OpenAlexW1570423461MaRDI QIDQ3598007FDOQ3598007
Authors: Yosuke Sato, Akira Nagai, Shutaro Inoue 
Publication date: 29 January 2009
Published in: Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87827-8_29
Recommendations
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Cites Work
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
- Comprehensive Gröbner bases
- A new algorithm for discussing Gröbner bases with parameters.
- Title not available (Why is that?)
- An alternative approach to comprehensive Gröbner bases
- Boolean Gröbner bases
- Improving the DISPGB algorithm using the discriminant ideal
- Title not available (Why is that?)
- Gröbner bases for polynomial ideals over commutative regular rings
Cited In (7)
- Boolean ideals and their varieties
- On the Computation of Comprehensive Boolean Gröbner Bases
- Elimination theory for addition and the frobenius map in polynomial rings
- Gröbner bases for polynomial systems with parameters
- On computation of Boolean involutive bases
- Ideal-specific elimination orders form a star-shaped region
- 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)
