5 citations · 9 across the 3 of their papers we have counts for
4 papers
-adic algorithm for bivariate Gröbner bases
Eric Schost, Catherine St-Pierre
We present a -adic algorithm to recover the lexicographic Gröbner basis of an ideal in with a generating set in , with a complexity…
Newton iteration for lexicographic Gröbner bases in two variables
Éric Schost, Catherine St-Pierre
We present an -adic Newton iteration with quadratic convergence for lexicographic Gröbner basis of zero dimensional ideals in two variables. We rely on a structural result about…
Change of basis for m-primary ideals in one and two variables
Seung Gyu Hyun, Stephen Melczer, Éric Schost +1
Following recent work by van der Hoeven and Lecerf (ISSAC 2017), we discuss the complexity of linear mappings, called untangling and tangling by those authors, that arise in the co…
A fast algorithm for solving linearly recurrent sequences
Seung Gyu Hyun, Stephen Melczer, Catherine St-Pierre
We present an algorithm which computes the term of a sequence satisfying a linear recurrence relation of order over a field in $O( \mathsf{M}(\bar d)\log(D) + \mat…