Fast Reduction of Bivariate Polynomials with Respect to Sufficiently Regular Gröbner Bases - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Joris van der Hoeven, Robin Larrieu. Fast Reduction of Bivariate Polynomials with Respect to Sufficiently Regular Gröbner Bases. In Manuel Kauers, Alexey Ovchinnikov, Éric Schost, editors, Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2018, New York, NY, USA, July 16-19, 2018. pages 199-206, ACM, 2018. [doi]

The following publications are possibly variants of this publication:

Fast Gröbner basis computation and polynomial reduction for generic bivariate idealsJoris van der Hoeven, Robin Larrieu. cca, 52(3):55-58, 2018. [doi]

Fast Gröbner basis computation and polynomial reduction for generic bivariate idealsJoris van der Hoeven, Robin Larrieu. aaecc, 30(6):509-539, 2019. [doi]

Computing generic bivariate Gröbner bases with MathemagixRobin Larrieu. cca, 53(2):41-44, 2019. [doi]

runs on WebDSL