Polynomial Systems Solving by Fast Linear Algebra

Jean-Charles Faugère 1 Pierrick Gaudry 2 Louise Huot 1 Guénaël Renault 1
1 PolSys - Polynomial Systems
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
2 CARAMEL - Cryptology, Arithmetic: Hardware and Software
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to stick to the most general case, we consider a representation of the solutions from which one can easily recover the exact solutions or a certified approximation of them. Under generic assumption, such a representation is given by the lexicographical Gröbner basis of the system and consists of a set of univariate polynomials. The best known algorithm for computing the lexicographical Gröbner basis is in $\widetilde{O}(d^{3n})$ arithmetic operations where $n$ is the number of variables and $d$ is the maximal degree of the equations in the input system. The notation $\widetilde{O}$ means that we neglect polynomial factors in $n$. We show that this complexity can be decreased to $\widetilde{O}(d^{\omega n})$ where $2 \leq \omega < 2.3727$ is the exponent in the complexity of multiplying two dense matrices. Consequently, when the input polynomial system is either generic or reaches the Bézout bound, the complexity of solving a polynomial system is decreased from $\widetilde{O}(D^3)$ to $\widetilde{O}(D^\omega)$ where $D$ is the number of solutions of the system. To achieve this result we propose new algorithms which rely on fast linear algebra. When the degree of the equations are bounded uniformly by a constant we propose a deterministic algorithm. In the unbounded case we present a Las Vegas algorithm.
Type de document :
Pré-publication, Document de travail
27 pages. 2013
Liste complète des métadonnées

Contributeur : Louise Huot <>
Soumis le : vendredi 12 juillet 2013 - 13:27:18
Dernière modification le : jeudi 22 novembre 2018 - 14:41:34
Document(s) archivé(s) le : dimanche 13 octobre 2013 - 06:10:10


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00816724, version 2
  • ARXIV : 1304.6039


Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault. Polynomial Systems Solving by Fast Linear Algebra. 27 pages. 2013. 〈hal-00816724v2〉



Consultations de la notice


Téléchargements de fichiers