89 citations · 407 across the 45 of their papers we have counts for
54 papers
Fast Deterministic Normal Bases and Circulant Polynomial Determinants
Mark Giesbrecht, Armin Jamshidpey, Éric Schost
Let describe an algebraic extension of a finite field , where is a prime power and is monic and irreducible…
Computing roadmaps in unbounded smooth real algebraic sets II: algorithm and complexity
Rémi Prébet, Mohab Safey El Din, Éric Schost
A roadmap for an algebraic set defined by polynomials with coefficients in the field of rational numbers is an algebraic curve contained in whose intersection…
-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…
Faster real root decision algorithm for symmetric polynomials
George Labahn, Cordian Riener, Mohab Safey El Din +2
In this paper, we consider the problem of deciding the existence of real solutions to a system of polynomial equations having real coefficients, and which are invariant under the a…
Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology
Yossef Musleh, Éric Schost
We present a new algorithm for computing the characteristic polynomial of an arbitrary endomorphism of a finite Drinfeld module using its associated crystalline cohomology. Our app…
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…