On the Computation of Comprehensive Boolean Gröbner Bases

DOI10.1007/978-3-642-04103-7_13zbMath1260.68480OpenAlexW2064662083MaRDI QIDQ3644095

Shutaro Inoue

Publication date: 10 November 2009

Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04103-7_13

zbMATH Keywords

Boolean Gröbner basiscomputer algebra system \texttt{Risa/Asir}

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (1)

Boolean Gröbner bases

Uses Software

• dpgb
• Risa/Asir

Cites Work

• 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
• On the Computation of Elimination Ideals of Boolean Polynomial Rings
• Gröbner bases for polynomial ideals over commutative regular rings
• Unnamed Item

This page was built for publication: On the Computation of Comprehensive Boolean Gröbner Bases