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

希尔伯特零点定理属于计数层级

Hilbert's Nullstellensatz is in the Counting Hierarchy

Cheriton School of Computer Science, University of Waterloo(滑铁卢大学切里顿计算机科学学院)

Robert Andrews, Abhibhav Garg, Éric Schost

AI总结:

本文证明希尔伯特零点定理属于计数层级,并展示了通过构造常深算术电路族计算多元余式的方法。

摘要:

我们证明了希尔伯特零点定理,即判断一个多元多项式方程组在基域的代数闭包中是否有解的问题,属于计数层级。更一般地说,我们证明了系统方程的解的数量可以在具有计数层级 oracle 访问权限的情况下用多项式时间计算。我们的结果特别适用于系数在有理数或有限域中的多项式。此前,这些问题的复杂性界最好的已知结果分别是PSPACE和FPSPACE。我们的主要技术贡献是构造了一个统一的常深算术电路族,用于计算多元余式。

英文摘要:

We show that Hilbert's Nullstellensatz, the problem of deciding if a system of multivariate polynomial equations has a solution in the algebraic closure of the underlying field, lies in the counting hierarchy. More generally, we show that the number of solutions to a system of equations can be computed in polynomial time with oracle access to the counting hierarchy. Our results hold in particular for polynomials with coefficients in either the rational numbers or a finite field. Previously, the best-known bounds on the complexities of these problems were PSPACE and FPSPACE, respectively. Our main technical contribution is the construction of a uniform family of constant-depth arithmetic circuits that compute the multivariate resultant.

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

↑