Fast Reduction of Bivariate Polynomials with Respect to Sufficiently Regular Gröbner Bases

DOI10.1145/3208976.3209003zbMath1467.13055OpenAlexW2787004013MaRDI QIDQ5120197

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)

Related Items (4)

Chinese Remainder Theorem for bivariate lexicographic Gröbner bases ⋮ Fast amortized multi-point evaluation ⋮ 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

This page was built for publication: Fast Reduction of Bivariate Polynomials with Respect to Sufficiently Regular Gröbner Bases