msolve: A library for solving polynomial systems J Berthomieu, C Eder, M Safey El Din
Proceedings of the 2021 on International Symposium on Symbolic and Algebraic …, 2021
63 2021 Polynomial root finding over local rings and application to error correcting codes J Berthomieu, G Lecerf, G Quintin
Applicable Algebra in Engineering, Communication and Computing 24 (6), 413-443, 2013
40 2013 Relaxed algorithms for J Berthomieu, J van der Hoeven, G Lecerf
Journal de théorie des nombres de Bordeaux 23 (3), 541-577, 2011
30 2011 Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences J Berthomieu, B Boyer, JC Faugère
Journal of Symbolic Computation 83, 36-67, 2017
29 2017 Relaxed p-adic Hensel lifting for algebraic systems J Berthomieu, R Lebreton
Proceedings of the 37th International Symposium on Symbolic and Algebraic …, 2012
26 2012 Computing Hironaka’s invariants: ridge and directrix J Berthomieu, P Hivert, H Mourtada
Arithmetic, Geometry, Cryptography and Coding Theory 2009 521, 9-20, 2010
25 2010 Polynomial-time algorithms for quadratic isomorphism of polynomials: The regular case J Berthomieu, JC Faugère, L Perret
Journal of Complexity 31 (4), 590-616, 2015
24 * 2015 Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations J Berthomieu, G Lecerf
Mathematics of Computation 81 (279), 1799-1821, 2012
21 * 2012 Faster change of order algorithm for Gröbner bases under shape and stability assumptions J Berthomieu, V Neiger, M Safey El Din
Proceedings of the 2022 International Symposium on Symbolic and Algebraic …, 2022
19 2022 Mathemagix: the quest of modularity and efficiency for symbolic and certified numeric computation? J van der Hoeven, G Lecerf, B Mourrain, P Trébuchet, J Berthomieu, ...
ACM Communications in Computer Algebra 45 (3/4), 186-188, 2012
19 2012 A polynomial-division-based algorithm for computing linear recurrence relations J Berthomieu, JC Faugère
Proceedings of the 2018 ACM International Symposium on Symbolic and …, 2018
11 2018 Guessing linear recurrence relations of sequence tuplesand p-recursive sequences with linear algebra J Berthomieu, JC Faugère
Proceedings of the ACM on International Symposium on Symbolic and Algebraic …, 2016
11 2016 Gröbner bases and critical values: The asymptotic combinatorics of determinantal systems J Berthomieu, A Bostan, A Ferguson, M Safey El Din
Journal of Algebra 602, 154-180, 2022
8 2022 New efficient algorithms for computing Gr\" obner bases of saturation ideals (F4SAT) and colon ideals (Sparse-FGLM-colon) J Berthomieu, C Eder, MSE Din
arXiv preprint arXiv:2202.13387, 2022
8 2022 Guessing Gröbner bases of structured ideals of relations of sequences J Berthomieu, M Safey El Din
Journal of Symbolic Computation 111, 1-26, 2022
6 2022 In-depth comparison of the Berlekamp–Massey–Sakata and the Scalar-FGLM algorithms: the adaptive variants J Berthomieu, JC Faugère
Journal of Symbolic Computation 101, 270-303, 2020
6 2020 Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian J Berthomieu, LM Pardo
Journal of Complexity 28 (3), 388-421, 2012
2 2012 Computing Generic Fibers of Polynomial Ideals with FGLM and Hensel Lifting J Berthomieu, R Mohr
Proceedings of the 2024 International Symposium on Symbolic and Algebraic …, 2024
1 2024 Modular matrix multiplication on GPU for polynomial system solving J Berthomieu, S Graillat, D Lesnoff, T Mary
ACM Communications in Computer Algebra 57 (2), 35-38, 2023
1 2023 On the computation of asymptotic critical values of polynomial maps and applications J Berthomieu, A Ferguson, M Safey El Din
arXiv preprint arXiv:2104.00913, 2021
1 2021 