arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1111.1224math.NTcs.CC
收藏

计数值集:算法和复杂性

Counting Value Sets: Algorithm and Complexity

Qi Cheng, Joshua E. Hill, Daqing Wan

摘要:

设$p$为素数。给定有限域$\F_{p^m}$上次数为$d$的$\F_{p^m}[x]$中的多项式,可以将其视为从$\F_{p^m}$到$\F_{p^m}$的映射,并检查此映射的图像,也称为值集。在本文中,我们提出了第一个非平凡的算法和第一个复杂性结果计算这个值集的基数。我们展示了这个基数和仿射空间中的簇族上的点数之间的基本联系。然后,我们应用Lauder和Wan的$p$ -adic点计数算法来计数这些点,从而得到用于计算值集的基数的非平凡算法。我们的算法的运行时间是$(pmd)^{O(d)}$。特别地,如果$p$相当小,则这是用于固定$d$的多项式时间算法。我们还表明,该问题是#P-硬的多项式时,在稀疏表示,$p=2$,$m$是允许变化的,或当多项式是作为一个直线程序,$m=1$和$p$是允许变化的。此外,我们还证明了由直线规划表示的多项式在素数阶有限域上是否有根是NP难的,从而解决了Kaltofen和Koiran在\cite{Kaltofen03,KaltofenKo05}中提出的一个公开问题.

英文摘要:

Let $p$ be a prime. Given a polynomial in $\F_{p^m}[x]$ of degree $d$ over the finite field $\F_{p^m}$, one can view it as a map from $\F_{p^m}$ to $\F_{p^m}$, and examine the image of this map, also known as the value set. In this paper, we present the first non-trivial algorithm and the first complexity result on computing the cardinality of this value set. We show an elementary connection between this cardinality and the number of points on a family of varieties in affine space. We then apply Lauder and Wan's $p$-adic point-counting algorithm to count these points, resulting in a non-trivial algorithm for calculating the cardinality of the value set. The running time of our algorithm is $(pmd)^{O(d)}$. In particular, this is a polynomial time algorithm for fixed $d$ if $p$ is reasonably small. We also show that the problem is #P-hard when the polynomial is given in a sparse representation, $p=2$, and $m$ is allowed to vary, or when the polynomial is given as a straight-line program, $m=1$ and $p$ is allowed to vary. Additionally, we prove that it is NP-hard to decide whether a polynomial represented by a straight-line program has a root in a prime-order finite field, thus resolving an open problem proposed by Kaltofen and Koiran in \cite{Kaltofen03,KaltofenKo05}.

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

↑