#### Filter Results:

- Full text PDF available (12)

#### Publication Year

1990

2019

- This year (4)
- Last 5 years (19)
- Last 10 years (36)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Marc Giusti, Grégoire Lecerf, Bruno Salvy
- J. Complexity
- 2001

Given a system of polynomial equations and inequations with coefficients in the field of rational numbers, we show how to compute a geometric resolution of the set of common roots of the system over… (More)

- Grégoire Lecerf
- J. Complexity
- 2003

We present a new probabilistic method for solving systems of polynomial equations and inequations. Our algorithm computes the equidimensional decomposition of the Zariski closure of the solution set… (More)

- Alin Bostan, Grégoire Lecerf, Éric Schost
- ISSAC
- 2003

The transposition principle, also called Tellegen's principle, is a set of transformation rules for linear programs. Yet, though well known, it is not used systematically, and few practical… (More)

- Grégoire Lecerf, M. H. Fessy, +7 authors Eric Stindel
- Orthopaedics & traumatology, surgery & research…
- 2009

UNLABELLED
BACKGROUND OBJECTIVE: Femoral offset is supposed to influence the results of hip replacement but little is known about the accurate method of measure and the true effect of offset… (More)

- Alin Bostan, Frédéric Chyzak, Bruno Salvy, Grégoire Lecerf, Éric Schost
- ISSAC
- 2007

It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series… (More)

- Grégoire Lecerf
- Foundations of Computational Mathematics
- 2002

Abstract. Newton's iterator is one of the most popular components of polynomial equation system solvers, either from the numeric or symbolic point of view. This iterator usually handles smooth… (More)

Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions

- Grégoire Lecerf
- ISSAC
- 2000

Let ƒ<subscrpt>1</subscrpt>, … , ƒ<subscrpt><italic>s</italic></subscrpt> be polynomials in <italic>n</italic> variables over a field of characteristic zero and <italic>d</italic> be the maximum of… (More)

- Guillaume Chèze, Grégoire Lecerf
- J. Complexity
- 2007

In the vein of recent algorithmic advances in polynomial factorization based on lifting and recombination techniques, we present new faster algorithms for computing the absolute factorization of a… (More)

- David Harvey, Joris van der Hoeven, Grégoire Lecerf
- J. Complexity
- 2016

We give a new algorithm for the multiplication of n-bit integers in the bit complexity model, which is asymptotically faster than all previously known algorithms. More precisely, we prove that two… (More)

- Grégoire Lecerf
- 2001