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

计算多项式的稀疏倍数

Computing sparse multiples of polynomials

Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak

摘要:

我们考虑的问题,找到一个多项式的稀疏倍数。给定域F上F[x]中d度的f,以及期望的稀疏度t,我们的目标是确定是否存在f的F[x]中的倍数h,使得h最多有t个非零项,如果是,找到这样的h。当F=Q,t为常数时,给出了d中的多项式时间算法和h中系数的大小。当F是一个有限域时,我们证明了这个问题至少和确定F的一个扩展域中元素的乘法阶一样难(这个问题被认为具有类似于整数分解的复杂性),并且当t=2时,这个下界是紧的。

英文摘要:

We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists a multiple h in F[x] of f such that h has at most t non-zero terms, and if so, to find such an h. When F=Q and t is constant, we give a polynomial-time algorithm in d and the size of coefficients in h. When F is a finite field, we show that the problem is at least as hard as determining the multiplicative order of elements in an extension field of F (a problem thought to have complexity similar to that of factoring integers), and this lower bound is tight when t=2.

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

↑