一种改进的代数退化测试方法
Improved Algebraic Degeneracy Testing
摘要:
在经典的线性退化检验问题中,给定$n$实数和一个$k$ -变量线性多项式$F$,对于某个常数$k$,必须判定是否存在集合中的$k$数$a_1,\ldots,a_k$使得$F(a_1,\ldots,a_k) = 0$ .我们考虑这个问题的一个推广,其中$F$是一个任意的常次数多项式,我们给出$k$集的$n$号码,并确定是否存在一个$k$ -元组的号码,一个在每个集合,$F$消失。我们给出了这个问题的第一个改进的天真的$O^*(n^{k-1})$算法(其中的$O^*(\cdot)$符号省略子多项式因子)。我们表明,这个问题可以解决的时间$O^*\left( n^{k - 2 + \frac 4{k+2}}\right)$甚至$k$和时间$O^*\left( n^{k - 2 + \frac{4k-8}{k^2-5}}\right)$的奇数$k$在真正的RAM模型的计算。我们还证明了,对于$k=4$,问题可以解决的时间$O^*(n^{2.625})$的代数决策树模型,并为$k=5$,它可以解决的时间$O^*(n^{3.56})$在同一个模型,都改善了上述统一的界限。我们所有的研究结果依赖于一个代数推广的标准满足在中间算法$k$ -SUM,最近的算法进展,半代数范围搜索的多项式方法提供动力。事实上,我们的主要技术成果具有更广泛的适用性,因为它提供了一个通用工具,用于检测任何维度上的点和代数曲面之间的关联和其他相互作用。特别是,它产生了一个有效的算法一般,代数版本的Hopcroft的点线的发病率检测问题在任何层面上。
英文摘要:
In the classical linear degeneracy testing problem, we are given $n$ real numbers and a $k$-variate linear polynomial $F$, for some constant $k$, and have to determine whether there exist $k$ numbers $a_1,\ldots,a_k$ from the set such that $F(a_1,\ldots,a_k) = 0$. We consider a generalization of this problem in which $F$ is an arbitrary constant-degree polynomial, we are given $k$ sets of $n$ numbers, and have to determine whether there exist a $k$-tuple of numbers, one in each set, on which $F$ vanishes. We give the first improvement over the naïve $O^*(n^{k-1})$ algorithm for this problem (where the $O^*(\cdot)$ notation omits subpolynomial factors). We show that the problem can be solved in time $O^*\left( n^{k - 2 + \frac 4{k+2}}\right)$ for even $k$ and in time $O^*\left( n^{k - 2 + \frac{4k-8}{k^2-5}}\right)$ for odd $k$ in the real RAM model of computation. We also prove that for $k=4$, the problem can be solved in time $O^*(n^{2.625})$ in the algebraic decision tree model, and for $k=5$ it can be solved in time $O^*(n^{3.56})$ in the same model, both improving on the above uniform bounds. All our results rely on an algebraic generalization of the standard meet-in-the-middle algorithm for $k$-SUM, powered by recent algorithmic advances in the polynomial method for semi-algebraic range searching. In fact, our main technical result is much more broadly applicable, as it provides a general tool for detecting incidences and other interactions between points and algebraic surfaces in any dimension. In particular, it yields an efficient algorithm for a general, algebraic version of Hopcroft's point-line incidence detection problem in any dimension.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。