Abstract
We show how we can make Boolean Gröbner base computations feasible on standard computer algebra systems which have a routine to compute Gröbner bases in polynomial rings over the Galois field \(\mathbb {GF}_2\). We also show that we can even compute a comprehensive Boolean Gröbner basis using only computations of Gröbner bases in a polynomial ring over \(\mathbb {GF}_2\). Our implementation on the computer algebra system Risa/Asir achieves tremendous speedup compared with previous implementations of Boolean Gröbner bases.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Sakai, K., Sato, Y.: Boolean Gröbner bases. ICOT Technical Momorandum 488. http://www.icot.or.jp/ARCHIVE/Museum/TRTM/tm-list-E.html (1988)
Sakai, K., Sato, Y., Menju, S.: Boolean Gröbner bases (revised). ICOT Technical Report 613. http://www.icot.or.jp/ARCHIVE/Museum/TRTM/tr-list-E.html (1991)
Inoue, S.: On the computation of comprehensive boolean gröbner bases. In: Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing (CASC 2009), LNCS 5743, pp. 130–141. Springer, Berlin (2009)
Sato, Y., et al.: Set constrains solvers (prolog version). http://www.icot.or.jp/ARCHIVE/Museum/FUNDING/funding-96-E.html (1996)
Sato, Y. et al.: Set constrains solvers (klic version). http://www.icot.or.jp/ARCHIVE/Museum/FUNDING/funding-98-E.html (1998)
Sato, Y., Inoue, S.: On the construction of comprehensive Boolean Gröbner bases. In: Proceedings of the 7th Asian Symposium on Computer Mathematics (ASCM 2005), pp. 145–148 (2005)
Sato, Y., Nagai, A., Inoue, I.: On the computation of elimination ideals of boolean polynomial rings. In: Proceedings of the 8th Asian Symposium on Computer Mathematics (ASCM 2007), LNAI 5081, pp. 338–348. Springer, Berlin (2008)
Inoue, S.: BGSet - a software to compute Boolean Gröbner bases. http://www.mi.kagu.tus.ac.jp/inoue/BGSet (2009)
Noro, M., et al.: A computer algebra system Risa/Asir. http://www.math.kobe-u.ac.jp/Asir/asir.html (2009)
Sato, Y., Inoue, S., Suzuki, A., Nabeshima, K.: Boolean Gröbner Bases and Sudoku. Submitted for publication
Weispfenning, V.: Gröbner bases in polynomial ideals over commutative regular rings. In Davenport Ed., J.H. (ed.) EUROCAL’87, pp. 336–347. Springer, LNCS 378 (1989)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Inoue, S., Nagai, A. (2014). On the Implementation of Boolean Gröbner Bases. In: Feng, R., Lee, Ws., Sato, Y. (eds) Computer Mathematics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43799-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-662-43799-5_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-43798-8
Online ISBN: 978-3-662-43799-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)