# BIBasis

BIBasis, a package for REDUCE and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases. 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 Gröbner bases. The implementations and user interfaces of the package for both systems are described in the respective sections of the paper. Also, we present results of comparisons of BIBasis with other packages and algorithms for constructing Boolean Gröbner bases available in the computer algebra systems.

## References in zbMATH (referenced in 3 articles , 1 standard article )

Showing results 1 to 3 of 3.

Sorted by year (- Zinin, M. V.: BIBasis, a package for REDUCE and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases (2012)
- Gerdt, V. P.; Zinin, M. V.; Blinkov, Yu. A.: On computation of Boolean involutive bases (2010)
- Gerdt, V. P.; Zinin, M. V.: Involutive method for computing Gröbner bases over (\mathbbF_2) (2008)