Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal


TitleBoolean Gröbner bases
Author(s) Shutaro Inoue, Katsusuke Nabeshima, Ko Sakai, Yosuke Sato, Akira Suzuki
TypeArticle in Journal
AbstractIn recent years, Boolean Gröbner bases have attracted the attention of many researchers, mainly in connection with cryptography. Several sophisticated methods have been developed for the computation of Boolean Gröbner bases. However, most of them only deal with Boolean polynomial rings over the simplest coefficient Boolean ring View the MathML source. Boolean Gröbner bases for arbitrary coefficient Boolean rings were first introduced by two of the authors almost two decades ago. While the work is not well-known among computer algebra researchers, recent active work on Boolean Gröbner bases inspired us to return to their development. In this paper, we introduce our work on Boolean Gröbner bases with arbitrary coefficient Boolean rings.
KeywordsBoolean ring; Gröbner bases; Comprehensive Gröbner bases
URL doi:10.1016/j.jsc.2010.10.011
JournalJournal of Symbolic Computation
NoteArticle in Press
Translation No
Refereed No