The following pages link to Grégoire Lecerf (Q192036):
Displaying 50 items.
- Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
- Even faster integer multiplication (Q306687) (← links)
- Relaxed algorithms for \(p\)-adic numbers (Q449711) (← links)
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers (Q652454) (← links)
- Modular composition via factorization (Q722764) (← links)
- (Q870478) (redirect page) (← links)
- On location and approximation of clusters of zeros: Case of embedding dimension one (Q870481) (← links)
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting (Q964741) (← links)
- The Projective Noether Maple Package: Computing the dimension of a projective variety (Q1587230) (← links)
- On the complexity of the Lickteig-Roy subresultant algorithm (Q1757020) (← links)
- Quadratic Newton iteration for systems with multiplicity (Q1865830) (← links)
- On the bit-complexity of sparse polynomial and series multiplication (Q1930169) (← links)
- Fast computation of generic bivariate resultants (Q1996880) (← links)
- Amortized multi-point evaluation of multivariate polynomials (Q2099269) (← links)
- Computing Riemann-Roch spaces via Puiseux expansions (Q2171940) (← links)
- Directed evaluation (Q2192677) (← links)
- Fast amortized multi-point evaluation (Q2238846) (← links)
- Fast multivariate multi-point evaluation revisited (Q2283121) (← links)
- Accelerated tower arithmetic (Q2338646) (← links)
- Degeneracy loci and polynomial equation solving (Q2340506) (← links)
- Lifting and recombination techniques for absolute factorization (Q2371310) (← links)
- Fast separable factorization and applications (Q2426955) (← links)
- A concise proof of the Kronecker polynomial system solver from scratch (Q2427141) (← links)
- Polynomial root finding over local rings and application to error correcting codes (Q2441447) (← links)
- Improved dense multivariate polynomial factorization algorithms (Q2457431) (← links)
- On location and approximation of clusters of zeros of analytic functions (Q2505645) (← links)
- On the complexity exponent of polynomial system solving (Q2658549) (← links)
- Randomized Root Finding over Finite FFT-fields using Tangent Graeffe Transforms (Q2819758) (← links)
- Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations (Q2894535) (← links)
- Fast Polynomial Multiplication over F <sub>2</sub> <sub>60</sub> (Q2985835) (← links)
- (Q3070806) (← links)
- Modular SIMD arithmetic in M <scp>athemagix</scp> (Q3176303) (← links)
- Faster Polynomial Multiplication over Finite Fields (Q3177879) (← links)
- Sharp precision in Hensel lifting for bivariate polynomial factorization (Q3377003) (← links)
- Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions (Q3454766) (← links)
- Preserving Syntactic Correctness While Editing Mathematical Formulas (Q4610027) (← links)
- Implementing Fast Carryless Multiplication (Q4628485) (← links)
- Complexity issues in bivariate polynomial factorization (Q4657300) (← links)
- (Q4660643) (← links)
- Ultimate complexity for numerical algorithms (Q5060285) (← links)
- On sparse interpolation of rational functions and gcds (Q5102020) (← links)
- Composition Modulo Powers of Polynomials (Q5119973) (← links)
- Sub-quadratic time for riemann-roch spaces (Q5145949) (← links)
- Mathemagix (Q5175317) (← links)
- On the complexity of multivariate blockwise polynomial multiplication (Q5244537) (← links)
- A short survey on Kantorovich (Q5270188) (← links)
- (Q5301646) (← links)
- Mathemagix: Towards Large Scale Programming for Symbolic and Certified Numeric Computations (Q5747899) (← links)
- A Gröbner free alternative for polynomial system solving (Q5938584) (← links)
- Univariate polynomial factorization over finite fields with large extension degree (Q6122401) (← links)
