BIBasis, a package for REDUCE and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases
From MaRDI portal
Publication:1758701
DOI10.1134/S0361768812020077zbMath1251.68309WikidataQ114847390 ScholiaQ114847390MaRDI QIDQ1758701
Publication date: 16 November 2012
Published in: Programming and Computer Software (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Ring-theoretic properties of Boolean algebras (06E20) Software, source code, etc. for problems pertaining to computer science (68-04)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Involutive method for computing Gröbner bases over \(\mathbb F_2\)
- New developments in the theory of Gröbner bases and applications to formal verification
- Involution. The formal theory of differential equations and its applications in computer algebra
- Involutive bases of polynomial ideals
- On computation of Boolean involutive bases
- Advances in Cryptology - CRYPTO 2003
- Computer Algebra in Scientific Computing
- Computations in algebraic geometry with Macaulay 2
This page was built for publication: BIBasis, a package for REDUCE and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases