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

次线性深度下求解QSAT

Solving QSAT in sublinear depth

Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron

摘要:

在$\mathbf{PSPACE}$ -完备问题中,QSAT或量化SAT是最常用来表明可由P系统的给定变体的族在多项式时间内可解的问题类包括整个$\mathbf{PSPACE}$的问题之一。然而,大多数解决方案需要相对于所考虑的QSAT实例的变量的数量呈线性的膜嵌套深度。虽然需要一定深度的系统,但由于深度1系统仅允许解决$\mathbf{P^{\#P}}$中的问题,因此直到现在还不清楚线性深度实际上是否必要。在这里,我们使用P系统与活性膜的电荷,我们提供了一个建设,证明QSAT可以解决一个次线性嵌套深度为$\frac{n}{\log n}$,其中$n$是作为输入的量化公式中的变量的数量。

英文摘要:

Among $\mathbf{PSPACE}$-complete problems, QSAT, or quantified SAT, is one of the most used to show that the class of problems solvable in polynomial time by families of a given variant of P systems includes the whole $\mathbf{PSPACE}$. However, most solutions require a membrane nesting depth that is linear with respect to the number of variables of the QSAT instance under consideration. While a system of a certain depth is needed, since depth 1 systems only allows to solve problems in $\mathbf{P^{\#P}}$, it was until now unclear if a linear depth was, in fact, necessary. Here we use P systems with active membranes with charges, and we provide a construction that proves that QSAT can be solved with a sublinear nesting depth of order $\frac{n}{\log n}$, where $n$ is the number of variables in the quantified formula given as input.

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

↑