MOHR Rafael
مسجل في الدكتوراه
وحـدة : PolSys
تاريـخ الوصـول : 01/11/2020
Tel: +33 1 44 27 71 02, Rafael.Mohr (at) nulllip6.fr
https://lip6.fr/Rafael.Mohr
وحـدة : PolSys
تاريـخ الوصـول : 01/11/2020
- Sorbonne Université - LIP6
Boîte courrier 169
Couloir 26-00, Étage 3, Bureau 315
4 place Jussieu
75252 PARIS CEDEX 05
FRANCE
Tel: +33 1 44 27 71 02, Rafael.Mohr (at) nulllip6.fr
https://lip6.fr/Rafael.Mohr
رئاسـة البـحث : Mohab SAFEY EL DIN
تأطـير مـشـترك : HORN Max, TU Kaiserslautern
Fast Groebner Bases Algorithms for Ideal Theoretic Computations in Commutative Algebra
إصدارات 2023-2024
-
2024
- J. Berthomieu, R. Mohr : “Computing Generic Fibres of Polynomial Ideals with FGLM and Hensel Lifting”, (2024)
-
2023
- Ch. Eder, P. Lairez, R. Mohr, M. Safey El Din : “A Signature-based Algorithm for Computing the Nondegenerate Locus of a Polynomial System”, Journal of Symbolic Computation, vol. 119, pp. 1-21, (Elsevier) (2023)
- Ch. Eder, P. Lairez, R. Mohr, M. Safey El Din : “A Direttissimo Algorithm for Equidimensional Decomposition”, ISSAC '23: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, Tromsø, Norway (2023)