A Baby Step–Giant Step Roadmap Algorithm for General Algebraic Sets - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Foundations of Computational Mathematics Année : 2014

A Baby Step–Giant Step Roadmap Algorithm for General Algebraic Sets

Résumé

Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ∈ D[X 1 , . . . , X k ], and computes a description of a roadmap of the set of zeros, Zer(Q, R k), of Q in R k . The complexity of the algorithm, measured by the number of arithmetic opera-tions in the ordered domain D, is bounded by d O(k √ k) , where d = deg(Q) ≥ 2. As a consequence, there exist algorithms for computing the number of semi-algebraically connected components of a real algebraic set, Zer(Q, R k), whose complexity is also bounded by d O(k √ k) , where d = deg(Q) ≥ 2. The best pre-viously known algorithm for constructing a roadmap of a real algebraic subset of R k defined by a polynomial of degree d has complexity d O(k 2) .
Fichier principal
Vignette du fichier
brss_revised-may-15-2014.pdf (586.53 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01096209 , version 1 (17-12-2014)

Identifiants

Citer

Saugata Basu, Marie-Françoise Roy, Mohab Safey El Din, Eric Schost. A Baby Step–Giant Step Roadmap Algorithm for General Algebraic Sets. Foundations of Computational Mathematics, 2014, 14 (6), pp.1117 - 1172. ⟨10.1007/s10208-014-9212-1⟩. ⟨hal-01096209⟩
292 Consultations
142 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More