Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals

DOI10.1145/3313880.3313882zbMath1437.13045OpenAlexW2800644154MaRDI QIDQ4630311

Robin Larrieu, Joris van der Hoeven

Publication date: 29 March 2019

Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)

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

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)

This page was built for publication: Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals