Computation of involutive and Gröbner bases using the tableau representation of polynomials

DOI10.1134/S0361768820020115zbMath1455.13049OpenAlexW3016934283MaRDI QIDQ2217202

D. A. Yanovich

Publication date: 18 December 2020

Published in: Programming and Computer Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0361768820020115

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 (1)

Heuristic algorithms for recognition of some cubic hypersurfaces

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Sparse polynomial division using a heap
• The geobucket data structure for polynomials
• Involutive bases of polynomial ideals
• Parallel modular computation of Gröbner and involutive bases
• Compact representation of polynomials for algorithms for computing Gröbner and involutive bases
• Advances in Cryptology - CRYPTO 2003
• Fast Software Encryption
• Involutive divisions of monomials

This page was built for publication: Computation of involutive and Gröbner bases using the tableau representation of polynomials