On computation of Boolean involutive bases
From MaRDI portal
Publication:1956959
DOI10.1134/S0361768810020106zbMath1214.68472OpenAlexW1985304375MaRDI QIDQ1956959
Yu. A. Blinkov, M. V. Zinin, Vladimir P. Gerdt
Publication date: 24 September 2010
Published in: Programming and Computer Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0361768810020106
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Hilbert-Samuel and Hilbert-Kunz functions; Poincaré series (13D40) Boolean programming (90C09) Ring-theoretic properties of Boolean algebras (06E20)
Related Items (1)
Uses Software
Cites Work
- Specialized computer algebra system GINV
- 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
- The theory of involutive divisions and an application to Hilbert function computations
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Involutive bases of polynomial ideals
- Janet's approach to presentations and resolutions for polynomials and linear PDEs
- On the Computation of Elimination Ideals of Boolean Polynomial Rings
- Advances in Cryptology - CRYPTO 2003
- Computer Algebra in Scientific Computing
- A Gröbner Basis Approach to CNF-Formulae Preprocessing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On computation of Boolean involutive bases
