Role of involutive criteria in computing Boolean Gröbner bases
From MaRDI portal
Publication:840090
DOI10.1134/S0361768809020042zbMATH Open1184.13078OpenAlexW2007031430MaRDI QIDQ840090FDOQ840090
Authors: M. V. Zinin, Vladimir Gerdt 
Publication date: 4 September 2009
Published in: Programming and Computer Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0361768809020042
Recommendations
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Cites Work
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Involutive bases of polynomial ideals
- A Gröbner approach to involutive bases
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in Cryptology - CRYPTO 2003
- Title not available (Why is that?)
- Effectiveness of involutive criteria in computation of polynomial Janet bases
- Detecting unnecessary reductions in an involutive basis computation
- Title not available (Why is that?)
- New developments in the theory of Gröbner bases and applications to formal verification
- Involutive method for computing Gröbner bases over \(\mathbb F_2\)
- On Connection Between Constructive Involutive Divisions and Monomial Orderings
- Computer Algebra in Scientific Computing
Cited In (3)
This page was built for publication: Role of involutive criteria in computing Boolean Gröbner bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q840090)
