Grégoire Lecerf
Journal of Complexity · 2001–2008
A researcher in the Science corpus: 2 papers; trusts 0 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Whom Grégoire Lecerf trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Grégoire Lecerf's perspective
Ordered by how strongly the researchers Grégoire Lecerf trusts endorse each paper. Same corpus, a different order for every researcher.
- Topics in Matrix Analysis
- The Design and Analysis of Computer Algorithms
- AND T
- Probabilistic algorithms for sparse polynomials
- The Magma Algebra System I: The User Language
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Chabauty methods and covering techniques applied to generalized Fermat equations
- Explicit 8-descent on elliptic curves
- On Computable Numbers, with an Application to the Entscheidungsproblem.
- A Gröbner Free Alternative for Polynomial System Solving (Journal of Complexity)
Their papers
- A concise proof of the Kronecker polynomial system solver from scratch (2008) — 54 citations
- A Gröbner Free Alternative for Polynomial System Solving (2001) — 302 citations