A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
On the Complexity of Computing the Topology of Real Algebraic Space Curves
[article]
2019
arXiv
pre-print
In this paper, we present a deterministic algorithm to find a strong generic position for an algebraic space curve. We modify our existing algorithm for computing the topology of an algebraic space curve and analyze the bit complexity of the algorithm. It is Õ (N^20), where N={d,τ}, d, τ are the degree bound and the bit size bound of the coefficients of the defining polynomials of the algebraic space curve. To our knowledge, this is the best bound among the existing work. It gains the existing results at least N^2.
arXiv:1901.10317v1
fatcat:rfmkowmcy5gwvaiojky2wo2gja