Role of involutive criteria in computing Boolean Gröbner bases

DOI10.1134/S0361768809020042zbMath1184.13078OpenAlexW2007031430MaRDI QIDQ840090

M. V. Zinin, Vladimir P. 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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items

Characteristic set algorithms for equation solving in finite fields

Cites Work

• Unnamed Item
• 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
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Involutive bases of polynomial ideals
• A Gröbner approach to involutive bases
• Effectiveness of involutive criteria in computation of polynomial Janet bases
• Detecting unnecessary reductions in an involutive basis computation
• On Connection Between Constructive Involutive Divisions and Monomial Orderings
• Advances in Cryptology - CRYPTO 2003
• Computer Algebra in Scientific Computing