Compact representation of polynomials for algorithms for computing Gröbner and involutive bases
From MaRDI portal
Publication:2629402
Recommendations
- Computation of involutive and Gröbner bases using the tableau representation of polynomials
- scientific article; zbMATH DE number 5052246
- An efficient method for computing comprehensive Gröbner bases
- scientific article; zbMATH DE number 3941661
- scientific article; zbMATH DE number 3899033
- Polynomial selection for computing Gröbner bases
- Computation of Gröbner bases
- A signature-based algorithm for computing Gröbner bases in solvable polynomial algebras
- An efficient implementation for computing Gröbner bases over algebraic number fields
- scientific article; zbMATH DE number 1163437
Cites work
- Advances in Cryptology - CRYPTO 2003
- Comparing the speed of programs for sparse polynomial multiplication
- Fast Software Encryption
- Introduction to algorithms
- Involutive bases of polynomial ideals
- Involutive division generated by an antigraded monomial ordering
- Involutive divisions of monomials
- Parallel modular computation of Gröbner and involutive bases
- The geobucket data structure for polynomials
Cited in
(7)- Computation of involutive and Gröbner bases using the tableau representation of polynomials
- scientific article; zbMATH DE number 1714661 (Why is no real title available?)
- COMPUTATIONALLY EFFICIENT RECURSIONS FOR TOP-ORDER INVARIANT POLYNOMIALS WITH APPLICATIONS
- scientific article; zbMATH DE number 1262464 (Why is no real title available?)
- scientific article; zbMATH DE number 1163437 (Why is no real title available?)
- scientific article; zbMATH DE number 5052246 (Why is no real title available?)
- Using dynamic memory reallocation in GInv
This page was built for publication: Compact representation of polynomials for algorithms for computing Gröbner and involutive bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2629402)