arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2502.00680cs.CC
收藏

关于 $\exists\mathbb R$ 的一些结构性复杂度结果

Some structural complexity results for $\exists\mathbb R$

Klaus Meer, Adrian Wurm

AI总结:

本文研究了复杂度类 $\exists\mathbb R$ 的结构性问题,通过构建谕示机证明了 NP 与 $\exists\mathbb R$ 的分离性,展示了类似 Ladner 定理的非完全问题存在性,并给出了基于描述复杂度的刻画。

摘要:

复杂度类 $\exists\mathbb R$ 代表在图灵模型中判定实数作为实闭域的存在性一阶理论的复杂度,近年来引起了广泛关注。众所周知,NP $\subseteq \exists\mathbb R \subseteq$ PSPACE。在他们的纲要中,Schaefer、Cardinal 和 Miltzow 给出了结果的全面展示,以及丰富的开放问题集合。在这里,我们回答了其中一些涉及 $\exists\mathbb R$ 作为复杂度类的结构问题。我们展示了 Baker、Gill 和 Solovay 经典结果的类似物,找到了能够和不能够将 NP 与 $\exists\mathbb R$ 分离的谕示机;展示了 Ladner 定理的类似物,证明在 $\exists\mathbb R \setminus$ NP 中存在非 $\exists\mathbb R$ 完全的问题(假设这两个类不同);以及通过描述复杂度对 $\exists\mathbb R$ 进行刻画。

英文摘要:

The complexity class $\exists\mathbb R$, standing for the complexity of deciding the existential first order theory of the reals as real closed field in the Turing model, has raised considerable interest in recent years. It is well known that NP $ \subseteq \exists\mathbb R\subseteq$ PSPACE. In their compendium, Schaefer, Cardinal, and Miltzow give a comprehensive presentation of results together with a rich collection of open problems. Here, we answer some of them dealing with structural issues of $\exists\mathbb R$ as a complexity class. We show analogues of the classical results of Baker, Gill, and Solovay finding oracles which do and do not separate NP form $\exists\mathbb R$, of Ladner's theorem showing the existence of problems in $\exists\mathbb R \setminus$ NP not being complete for $\exists\mathbb R$ (in case the two classes are different), as well as a characterization of $\exists\mathbb R$ by means of descriptive complexity.

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

↑