Gro¨bner bases: a computational approach to commutative algebra
Gro¨bner bases: a computational approach to commutative algebra
Involutive bases of polynomial ideals
Mathematics and Computers in Simulation - Special issue: Simplification of systems of algebraic and differential equations with applications
Computations in algebraic geometry with Macaulay 2
Computations in algebraic geometry with Macaulay 2
A pommaret division algorithm for computing Grobner bases in boolean rings
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Involutive method for computing Gröbner bases over $$ \mathbb{F}_2 $$
Programming and Computing Software
On computation of Boolean involutive bases
Programming and Computing Software
Involution: The Formal Theory of Differential Equations and its Applications in Computer Algebra
Involution: The Formal Theory of Differential Equations and its Applications in Computer Algebra
On compatibility of discrete relations
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
| Hi-index | 0.00 |
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.