7 citations · 14 across the 8 of their papers we have counts for
8 papers
Certifying a probabilistic parallel modular algorithm for rational univariate representation
Bernard Parisse
This paper is about solving polynomial systems. It first recalls how to do that efficiently with a very high probability of correctness by reconstructing a rational univariate repr…
Computing huge Groebner basis like cyclic10 over $\Q$ with Giac
Bernard Parisse
We present a short description on how to fine-tune the modular algorithm implemented in the Giac computer algebra system to reconstruct huge Groebner basis over $\Q$.The classical…
Compiling LATEX to computer algebra-enabled HTML5
Bernard Parisse
This document explains how to create or modify an existing LATEX document with commands enabling computations in the HTML5 output: when the reader opens the HTML5 output, he can ru…
Sparse multivariate factorization by mean of a few bivariate factorizations
Bernard Parisse
We describe an algorithm to factor sparse multivariate polynomials using O(d) bivariate factorizations where d is the number of variables. This algorithm is implemented in the Giac…
A probabilistic and deterministic modular algorithm for computing Groebner basis over $\Q$
Bernard Parisse
Modular algorithm are widely used in computer algebra systems (CAS), for example to compute efficiently the gcd of multivariate polynomials. It is known to work to compute Groebner…
Jordan Normal and Rational Normal Form Algorithms
Bernard Parisse, Morgane Vaughan
In this paper, we present a determinist Jordan normal form algorithms based on the Fadeev formula: \[(λ\cdot I-A) \cdot B(λ)=P(λ) \cdot I\] where is 's comatri…