Elementary complexity theory

To conclude these preliminaries, we recall known fast algorithms for three polynomial matrix subroutines used in our determinant algorithm: multiplication with unbalanced

Furthermore, as shown by Exam- ple 1, in order to determine this differential Hilbert function it may be necessary to compute derivatives of the original equations up to order ν,

It is natural to examine whether we can use our relaxed extended reduction algorithm in order to speed up Gröbner basis computations.. We will restrict ourself to

We have also sketched families of higher genus hyperelliptic curves whose deterministic algebraic parameterization is based on solvable polynomials of higher degree arising from

Enfin, un modèle complet d’un dispositif de retenue de véhicule a été effectué et corrélé sur un essai de choc réel à l’aide d’une méthode prenant en compte la variation

In this paper we have given new, deterministic algorithms for computing the Hermite normal form and the determinant of a nonsingular polynomial matrix.. Our methods are based on

Regarding exact evaluation, we prove that the interlace polynomial is # P -hard to evaluate at every point of the plane, except at one line, where it is trivially polynomial