On the Computation of Elimination Ideals of Boolean Polynomial Rings
From MaRDI portal
Publication:3598007
DOI10.1007/978-3-540-87827-8_29zbMath1166.13303OpenAlexW1570423461MaRDI QIDQ3598007
Akira Nagai, Shutaro Inoue, Yosuke Sato
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
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (4)
Gröbner bases for polynomial systems with parameters ⋮ Boolean Gröbner bases ⋮ On computation of Boolean involutive bases ⋮ On the Computation of Comprehensive Boolean Gröbner Bases
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Boolean Gröbner bases
- Comprehensive Gröbner bases
- A new algorithm for discussing Gröbner bases with parameters.
- An alternative approach to comprehensive Gröbner bases
- Improving the DISPGB algorithm using the discriminant ideal
- A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
- Gröbner bases for polynomial ideals over commutative regular rings
This page was built for publication: On the Computation of Elimination Ideals of Boolean Polynomial Rings