arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1104.1510cs.SC
收藏

代数曲线拓扑计算的最坏界

A Worst-case Bound for Topology Computation of Algebraic Curves

Michael Kerber, Michael Sagraloff

摘要:

计算代数平面曲线$\mathcal{C}$的拓扑意味着计算与$\mathcal{C}$同素的组合图,从而在$\mathbb{R}^2$中表示其拓扑。证明了对于系数以$2^ρ$为界的$n$次多项式,其诱导曲线的拓扑可以用$\tilde{O}(n^8(n+ρ^2))$位运算确定性地计算,而用$\tilde{O}(n^8ρ^2)$位运算和期望的随机算法计算.我们的分析提高了以前最知名的复杂性界限的一个因素的$n^2$。改进的基础上的新技术来计算和细化隔离区间的多项式的实根,并通过随后的摊还分析的关键纤维的代数曲线。

英文摘要:

Computing the topology of an algebraic plane curve $\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\mathcal{C}$ and thus represents its topology in $\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with coefficients bounded by $2^ρ$, the topology of the induced curve can be computed with $\tilde{O}(n^8(n+ρ^2))$ bit operations deterministically, and with $\tilde{O}(n^8ρ^2)$ bit operations with a randomized algorithm in expectation. Our analysis improves previous best known complexity bounds by a factor of $n^2$. The improvement is based on new techniques to compute and refine isolating intervals for the real roots of polynomials, and by the consequent amortized analysis of the critical fibers of the algebraic curve.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑