Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals
From MaRDI portal
Publication:2280315
DOI10.1007/s00200-019-00389-9zbMath1451.13084OpenAlexW4393597376MaRDI QIDQ2280315
Robin Larrieu, Joris van der Hoeven
Publication date: 18 December 2019
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://hal.science/hal-01770408
Related Items (5)
Polynomial-division-based algorithms for computing linear recurrence relations ⋮ Elimination ideal and bivariate resultant over finite fields ⋮ Towards a Gröbner-free approach to coding ⋮ High-order lifting for polynomial Sylvester matrices ⋮ Fast computation of generic bivariate resultants
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On fast multiplication of polynomials over arbitrary algebras
- Fast multiplication of polynomials over fields of characteristic 2
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Hilbert series for ideals generated by generic forms
- Involutive bases of polynomial ideals
- Fast on-line integer multiplication
- Relax, but don't be too lazy
- Degrevlex Gröbner bases of generic complete intersections.
- Multi-point evaluation in higher dimensions
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
- On the complexity of the \(F_5\) Gröbner basis algorithm
- Fast multiplication of large numbers
- Modern Computer Algebra
- On the complexity of solving bivariate systems
- Faster Polynomial Multiplication over Finite Fields
- Faster relaxed multiplication
- Membership in polynomial ideals over Q is exponential space complete
- Fast Reduction of Bivariate Polynomials with Respect to Sufficiently Regular Gröbner Bases
This page was built for publication: Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals