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

Details:

   
TitleOn computation of Boolean involutive bases.
Author(s) Yuri A. Blinkov, Vladimir P. Gerdt, M.V. Zinin
TypeArticle in Journal
AbstractGröbner bases in Boolean rings can be calculated by an involutive algorithm based on the Janet or Pommaret division. The Pommaret division allows calculations immediately in the Boolean ring, whereas the Janet division implies use of a polynomial ring over field 𝔽2. In this paper, both divisions are considered, and distributive and recursive representations of Boolean polynomials are compared from the point of view of calculation effectiveness. Results of computer experiments with both representations for an algorithm based on the Pommaret division and for lexicographical monomial order are presented.
ISSN0361-7688; 1608-3261/e
URL http://link.springer.com/article/10.1134%2FS0361768810020106
LanguageEnglish
JournalProgram. Comput. Softw.
Volume36
Number2
Pages117--123
PublisherSpringer US, New York, NY; Pleiades Publishing, New York, NY; MAIK ``Nauka/Interperiodica
Year2010
Edition0
Translation No
Refereed No
Webmaster