Involutive method for computing Gröbner bases over \(\mathbb F_2\)

DOI10.1134/S0361768808040026zbMath1185.68868OpenAlexW132758974MaRDI QIDQ840027

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/s0361768808040026

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

Role of involutive criteria in computing Boolean Gröbner bases ⋮ A Groebner bases-based approach to backward reasoning in rule based expert systems ⋮ On the efficiency of solving Boolean polynomial systems with the characteristic set method ⋮ On computation of Boolean involutive bases ⋮ Parallelization of matrix algorithms for Gröbner basis computation ⋮ BIBasis, a package for REDUCE and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases ⋮ A logic-algebraic approach to decision taking in a railway interlocking system

Uses Software

• CoCoA
• FGb
• Maple
• SINGULAR
• BIBasis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On selection of nonmultiplicative prolongations in computation of Janet bases
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Involutive bases of polynomial ideals
• Effectiveness of involutive criteria in computation of polynomial Janet bases
• Detecting unnecessary reductions in an involutive basis computation
• Gröbner bases and generation of difference schemes for partial differential equations
• A Mathematica Package for Simulation of Quantum Computation
• SINGULAR
• Advances in Cryptology - CRYPTO 2003
• Computer Algebra in Scientific Computing
• Progress in Cryptology - INDOCRYPT 2004
• Fast search for the Janet divisor