序中求根的复杂性
The complexity of root-finding in orders
AI总结:
本文研究序中多项式求根的计算复杂性,证明该问题依概率为NP完全,对三次及以下多项式给出完整复杂性分类,并在特定条件下证明不可判定性。
摘要:
给定一个序(其加法群是有限秩自由群的交换环),一个自然的计算问题是固定的单变量多项式 $f \in \mathbb{Z}[X]$ 是否在该环中有根。本文证明其计算难度强烈依赖于 $f$ 的算术性质。我们证明以概率 1 判定 $f$ 是否有根是 NP 完全的。对于 $\text{deg } f \leq 3$,我们给出了计算复杂性的完整分类:某些特殊的 $f$ 存在多项式时间算法,其余所有 $f$ 该问题均为 NP 完全。此外,在 $\mathbb{Q}(i)$ 的希尔伯特第十问题条件下,我们证明 $f = (X^2+1)^2$ 时该问题不可判定。证明 NP 完全的关键是以往工作中新发现的 NP 完全群论问题,以及对判别式仅被 3 整除的三次多项式的完整分类。
英文摘要:
Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f \in \mathbb{Z}[X]$ has a root in this ring. In this paper, we show that the computational difficulty of this depends strongly on the arithmetic properties of $f$. We show that with probability 1, determining whether $f$ has a root is NP-complete. For $\text{deg } f \leq 3$ we give a full classification of the computational complexity: some special $f$ admit a polynomial-time algorithm, and for all other $f$ the problem is NP-complete. Additionally, we prove the problem is undecidable for $f = (X^2+1)^2$, conditional on Hilberts Tenth Problem for $\mathbb{Q}(i)$. The key ingredients for proving NP-completeness are a new source of NP-complete group-theoretic problems developed in previous work, and a full classification of cubic polynomials with discriminant divisible only by $3$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。