An improved complexity bound for computing the topology of a real algebraic space curve - Inria - Institut national de recherche en sciences et technologies du numérique
Article Dans Une Revue Journal of Symbolic Computation Année : 2024

An improved complexity bound for computing the topology of a real algebraic space curve

Résumé

We propose a new algorithm to compute the topology of a real algebraic space curve. The novelties of this algorithm are a new technique to achieve the lifting step which recovers points of the space curve in each plane fiber from several projections and a weaker notion of generic position. As distinct to previous work, our sweep generic position does not require that x-critical points have different x-coordinates. The complexity of achieving this sweep generic position property is thus no longer a bottleneck in term of complexity. The bit complexity of our algorithm is O(d^18 + d^17 τ ) where d and τ bound the degree and the bitsize of the integer coefficients, respectively, of the defining polynomials of the curve and polylogarithmic factors are ignored. To the best of our knowledge, this improves upon the best currently known results at least by a factor of d^2 .
Fichier principal
Vignette du fichier
2024_JSC_author-version.pdf (627.34 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04874978 , version 1 (08-01-2025)

Licence

Identifiants

Citer

Jin-San Cheng, Kai Jin, Marc Pouget, Junyi Wen, Bingwei Zhang. An improved complexity bound for computing the topology of a real algebraic space curve. Journal of Symbolic Computation, 2024, 125, ⟨10.1016/j.jsc.2024.102309⟩. ⟨hal-04874978⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

More