A pommaret division algorithm for computing Grobner bases in boolean rings

DOI10.1145/1390768.1390784MaRDI QIDQ5301609zbMATH OpenOpenAlexFDO

Authors M. V. Zinin, Vladimir Gerdt

Publication date 20 January 2009

Published in Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1390768.1390784

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)

Recommendations

• On computation of Boolean involutive bases
• Role of involutive criteria in computing Boolean Gröbner bases
• Boolean Gröbner bases. Theory, algorithms and applications
• On the implementation of Boolean Gröbner bases
• On the implementation of Boolean Gröbner bases

Cited in

(7)

• scientific article; zbMATH DE number 4037907 (Why is no real title available?)
• Boolean ideals and their varieties
• Involutive method for computing Gröbner bases over \(\mathbb F_2\)
• scientific article; zbMATH DE number 5733435 (Why is no real title available?)
• Role of involutive criteria in computing Boolean Gröbner bases
• On computation of Boolean involutive bases
• Boolean Gröbner bases

This page was built for publication: A pommaret division algorithm for computing Grobner bases in boolean rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301609)