Compact representation of polynomials for algorithms for computing Gröbner and involutive bases

DOI10.1134/S0361768815020097zbMath1362.68298MaRDI QIDQ2629402

D. A. Yanovich

Publication date: 6 July 2016

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

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

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

Uses Software

• SageMath
• PoSSo

Cites Work

• Unnamed Item
• The geobucket data structure for polynomials
• Involutive bases of polynomial ideals
• Parallel modular computation of Gröbner and involutive bases
• Involutive Division Generated by an Antigraded Monomial Ordering
• Comparing the speed of programs for sparse polynomial multiplication
• Advances in Cryptology - CRYPTO 2003
• Fast Software Encryption
• Involutive divisions of monomials