黑箱根属、零元数和超越度的特例算法
Special-case Algorithms for Blackbox Radical Membership, Nullstellensatz and Transcendence Degree
摘要:
径向隶属度检验,以及希尔伯特零点检验(HN)的特殊情况,是一个基本的计算代数问题。它是NP-困难的,并且由于有效的Nullstellenetrant边界而具有著名的PSPACE算法。我们确定了一个有用的情况下,这些问题的实用算法,和改进的界限,可以给出,当超越度$r$的输入多项式小于变量的数量$n$。如果$d$是输入多项式的度界,那么我们在大约$d^r$时间内解决根成员关系(即使输入多项式是黑盒)。先前最佳的是$> d^n$时间(总是,$d^n\ge d^r$)。此外,我们显着提高了有效的Nullstelleness度界,当$r\ll n$。结构上,我们的证明表明,这些问题减少到超越度$\ge r$的$r+1$多项式的情况下。这个输入实例(对应于无或唯一的零化子)是HN的硬度的核心。我们的证明方法调用基本的代数几何。
英文摘要:
Radical membership testing, and the special case of Hilbert's Nullstellensatz (HN), is a fundamental computational algebra problem. It is NP-hard; and has a famous PSPACE algorithm due to effective Nullstellensatz bounds. We identify a useful case of these problems where practical algorithms, and improved bounds, could be given, when the transcendence degree $r$ of the input polynomials is smaller than the number of variables $n$. If $d$ is the degree bound on the input polynomials, then we solve radical membership (even if input polynomials are blackboxes) in around $d^r$ time. The prior best was $> d^n$ time (always, $d^n\ge d^r$). Also, we significantly improve effective Nullstellensatz degree-bound, when $r\ll n$. Structurally, our proof shows that these problems reduce to the case of $r+1$ polynomials of transcendence degree $\ge r$. This input instance (corresponding to none or a unique annihilator) is at the core of HN's hardness. Our proof methods invoke basic algebraic-geometry.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。