Zobrazeno 1 - 4
of 4
pro vyhledávání: '"M. V. Zinin"'
Autor:
M. V. Zinin
Publikováno v:
Programming and Computer Software. 38:92-101
In this paper, we describe the BIBasis package designed for REDUCE and Macaulay2 computer algebra systems, which allows one to compute Boolean involutive bases and Grobner bases. The implementations and user interfaces of the package for both systems
Publikováno v:
Programming and Computer Software. 36:117-123
Grobner 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 rin
Autor:
Vladimir P. Gerdt, M. V. Zinin
Publikováno v:
Programming and Computer Software. 35:90-97
In this paper, effectiveness of using four criteria in an involutive algorithm based on the Pommaret division for construction of Boolean Grobner bases is studied. One of the results of this study is the observation that the role of the criteria in c
Autor:
Vladimir P. Gerdt, M. V. Zinin
Publikováno v:
Programming and Computer Software. 34:191-203
In this paper, an involutive algorithm for computation of Grobner bases for polynomial ideals in a ring of polynomials in many variables over the finite field $$ \mathbb{F}_2 $$ with the values of variables belonging of $$ \mathbb{F}_2 $$ is consider