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

Details:

   
TitleRole of involutive criteria in computing Boolean Gr\"obner bases.
Author(s) Vladimir P. Gerdt, M.V. Zinin
TypeArticle in Journal
AbstractIn this paper, effectiveness of using four criteria in an involutive algorithm based on the Pommaret division for construction of Boolean Gröbner bases is studied. One of the results of this study is the observation that the role of the criteria in computations in Boolean rings is much less than that in computations in an ordinary ring of polynomials over the field of integers. Another conclusion of this study is that the efficiency of the second and/or third criteria is higher than that of the two others.
ISSN0361-7688; 1608-3261/e
URL http://link.springer.com/article/10.1134%2FS0361768809020042
LanguageEnglish
JournalProgram. Comput. Softw.
Volume35
Number2
Pages90--97
PublisherSpringer US, New York, NY; Pleiades Publishing, New York, NY; MAIK ``Nauka/Interperiodica
Year2009
Edition0
Translation No
Refereed No
Webmaster