Fast reduction of bivariate polynomials with respect to sufficiently regular Gröbner bases

DOI10.1145/3208976.3209003MaRDI QIDQ5120197zbMATH OpenOpenAlexFDO

Authors Joris van der Hoeven, Robin Larrieu

Publication date 9 September 2020

Published in Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3208976.3209003

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)

Recommendations

• Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals
• Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• The Gröbner basis of the ideal of vanishing polynomials
• scientific article; zbMATH DE number 2151220

Cited in

(9)

• On monomial reduction and polynomial expressions with respect to binomial ideals
• Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals
• Certified numerical algorithm for isolating the singularities of the plane projection of generic smooth space curves
• Chinese Remainder Theorem for bivariate lexicographic Gröbner bases
• Bivariate polynomial reduction and elimination ideal over finite fields
• Fast amortized multi-point evaluation
• Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals
• Amortized bivariate multi-point evaluation
• Computing generic bivariate Gröbner bases with Mathemagix

This page was built for publication: Fast reduction of bivariate polynomials with respect to sufficiently regular Gröbner bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5120197)