Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals
From MaRDI portal
Publication:2280315
DOI10.1007/S00200-019-00389-9zbMATH Open1451.13084OpenAlexW4393597376MaRDI QIDQ2280315FDOQ2280315
Authors: Joris van der Hoeven, Robin Larrieu 
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
Recommendations
- Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals
- Fast reduction of bivariate polynomials with respect to sufficiently regular Gröbner bases
- Fast computation of generic bivariate resultants
- An extension of Buchberger's algorithm to compute all reduced Gröbner bases of a polynomial ideal
- Fast computation of Gröbner basis of homogeneous ideals of \(\mathbb{F}[x, y]\)
Cites Work
- 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)\)
- Involutive bases of polynomial ideals
- Relax, but don't be too lazy
- Fast multiplication of large numbers
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Title not available (Why is that?)
- On the complexity of solving bivariate systems
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Title not available (Why is that?)
- Modern computer algebra
- Degrevlex Gröbner bases of generic complete intersections.
- Title not available (Why is that?)
- Multi-point evaluation in higher dimensions
- Fast on-line integer multiplication
- Faster relaxed multiplication
- On the complexity of the \(F_5\) Gröbner basis algorithm
- Membership in polynomial ideals over \(\mathcal{Q}\) is exponential space complete
- Faster polynomial multiplication over finite fields
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
- Hilbert series for ideals generated by generic forms
- Fast reduction of bivariate polynomials with respect to sufficiently regular Gröbner bases
Cited In (12)
- Polynomial-division-based algorithms for computing linear recurrence relations
- Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals
- Fast computation of generic bivariate resultants
- Towards a Gröbner-free approach to coding
- High-order lifting for polynomial Sylvester matrices
- Fast reduction of bivariate polynomials with respect to sufficiently regular Gröbner bases
- Bivariate polynomial reduction and elimination ideal over finite fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases
- Elimination ideal and bivariate resultant over finite fields
- Computing generic bivariate Gröbner bases with Mathemagix
Uses Software
This page was built for publication: Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2280315)
