A pommaret division algorithm for computing Grobner bases in boolean rings
From MaRDI portal
Publication:5301609
DOI10.1145/1390768.1390784zbMath1487.13056MaRDI QIDQ5301609
M. V. Zinin, Vladimir P. 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
68W30: Symbolic computation and algebraic computation
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)