É. Schost

Publications
Influence

Interpolation of polynomials given by straight-line programs

Sanchit Garg, É. Schost
Computer Science, Mathematics
Theor. Comput. Sci.
1 June 2009

We give an algorithm for the interpolation of a polynomial A given by a straight-line program. Expand

X. Dahan, É. Schost
Mathematics, Computer Science
ISSAC '04
4 July 2004

We study the triangular representation of zero-dimensional varieties defined over the rational field and prove polynomial bounds in terms of intrinsic quantities for the height (resp. degree) of the coefficients of such triangular sets, whereas previous bounds were exponential. Expand

Polynomial evaluation and interpolation on special sets of points

A. Bostan, É. Schost
Computer Science, Mathematics
J. Complex.
1 August 2005

We give complexity estimates for the problems of evaluation and interpolation on various polynomial bases. Expand

Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier-Manin Operator

A. Bostan, P. Gaudry, É. Schost
Mathematics, Computer Science
SIAM J. Comput.
1 February 2007

We study the complexity of computing one or several terms (not necessarily consecutive) in a recurrence with polynomial coefficients. Expand

Polar varieties and computation of one point in each connected component of a smooth real algebraic set

M. S. E. Din, É. Schost
Mathematics, Computer Science
ISSAC '03
3 August 2003

We show that computing suitable sections of the polar varieties associated to generic projections of V gives at least one point in each connected component of V ∩ <b>R</b><sup>. Expand

Genus 2 point counting over prime fields

P. Gaudry, É. Schost
Computer Science, Mathematics
J. Symb. Comput.
1 April 2012

We find a method for constructing secure genus 2 curves over a large prime field that is suitable for cryptosystems. Expand

Computing Parametric Geometric Resolutions

É. Schost
Mathematics, Computer Science
Applicable Algebra in Engineering, Communication…
1 February 2003

We define the notion of parametric geometric resolution as a means to represent some generic solutions in terms of the parameters. Expand

Fast algorithms for computing isogenies between elliptic curves

A. Bostan, F. Morain, B. Salvy, É. Schost
Mathematics, Computer Science
Math. Comput.
6 September 2006

We introduce a new algorithm that computes an isogeny of degree l (l different from the characteristic) in time quasi-linear with respect to l. Expand

A Low-Memory Parallel Version of Matsuo, Chao, and Tsujii?s Algorithm

P. Gaudry, É. Schost
Mathematics, Computer Science
ANTS
13 June 2004

We present an algorithm based on the birthday paradox, which is a low-memory parallel counterpart to the algorithm of Matsuo, Chao and Tsujii, but the memory requirement drops from several GB to almost nothing. Expand

Complexity results for triangular sets

É. Schost
Computer Science, Mathematics
J. Symb. Comput.
1 September 2003

We study the representation of the solutions of a polynomial system by triangular sets, and concentrate on the positive-dimensional case. Expand

Recommended Authors