Sharper complexity bounds for zero-dimensional Göbner bases and polynomial system solving - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Algebra and Computation Année : 2011

Sharper complexity bounds for zero-dimensional Göbner bases and polynomial system solving

Résumé

The main purpose of this paper is to improve the bound of complexity of the well-known algorithms on polynomial ideals having complexities polynomial in dn, where d is the maximal degree of input polynomials and n is the number of variables. Instead of this bound, we present the more accurate bound max{S, Dn} where S is the size of the input polynomials in dense representation, and D is the arithmetic mean value of the degrees of input polynomials.

Dates et versions

hal-01148199 , version 1 (04-05-2015)

Identifiants

Citer

Amir Hashemi, Daniel Lazard. Sharper complexity bounds for zero-dimensional Göbner bases and polynomial system solving. International Journal of Algebra and Computation, 2011, 21 (5), pp.703--713. ⟨10.1142/s0218196711006364⟩. ⟨hal-01148199⟩
95 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More