C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Rafael Mohr
ORCID
Publication Activity (10 Years)
Years Active: 2022-2024
Publications (10 Years): 6
Top Topics
Experimental Evaluation
Computationally Efficient
Decomposition Algorithm
Polynomially Bounded
Top Venues
CoRR
ISSAC
ACM Commun. Comput. Algebra
J. Symb. Comput.
</>
Publications
</>
Jérémy Berthomieu
,
Rafael Mohr
Computing Generic Fibres of Polynomial Ideals with FGLM and Hensel Lifting.
CoRR
(2024)
Christian Eder
,
Pierre Lairez
,
Rafael Mohr
,
Mohab Safey El Din
A signature-based algorithm for computing the nondegenerate locus of a polynomial system.
J. Symb. Comput.
119 (2023)
Christian Eder
,
Pierre Lairez
,
Rafael Mohr
,
Mohab Safey El Din
A Direttissimo Algorithm for Equidimensional Decomposition.
ISSAC
(2023)
Christian Eder
,
Pierre Lairez
,
Rafael Mohr
,
Mohab Safey El Din
A Direttissimo Algorithm for Equidimensional Decomposition.
CoRR
(2023)
Christian Eder
,
Pierre Lairez
,
Rafael Mohr
,
Mohab Safey El Din
A Signature-based Algorithm for Computing the Nondegenerate Locus of a Polynomial System.
CoRR
(2022)
Christian Eder
,
Pierre Lairez
,
Rafael Mohr
,
Mohab Safey El Din
Towards signature-based gröbner basis algorithms for computing the nondegenerate locus of a polynomial system.
ACM Commun. Comput. Algebra
56 (2) (2022)