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

Computing the First Few Betti Numbers of Semi-algebraic Sets in Single Exponential Time

Saugata Basu

英文摘要:

In this paper we describe an algorithm that takes as input a description of a semi-algebraic set $S \subset \R^k$, defined by a Boolean formula with atoms of the form $P > 0, P < 0, P=0$ for $P \in {\mathcal P} \subset \R[X_1,...,X_k],$ and outputs the first $\ell+1$ Betti numbers of $S$, $b_0(S),...,b_\ell(S).$ The complexity of the algorithm is $(sd)^{k^{O(\ell)}},$ where where $s = #({\mathcal P})$ and $d = \max_{P\in {\mathcal P}}{\rm deg}(P),$ which is singly exponential in $k$ for $\ell$ any fixed constant. Previously, singly exponential time algorithms were known only for computing the Euler-Poincaré characteristic, the zero-th and the first Betti numbers.

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

↑