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

查询订单

Query Order

Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung

摘要:

我们研究了查询顺序对计算能力的影响,并表明,$\pjk$ -语言可计算通过一个多项式时间机器给出一个查询的第j级的布尔层次结构,然后由一个查询的第k级的布尔层次结构等于$\redttnp{j+2k-1}$,如果j是偶数和k是奇数,否则等于$\redttnp{j+2k}$。因此,除非多项式层次崩溃,否则对于每个$1\leq j \leq k$:$\pjk = \pkj \iff (j=k) \lor (j{is even} \land k=j+1)$。我们扩展我们的分析,以适用于更一般的查询类。

英文摘要:

We study the effect of query order on computational power, and show that $\pjk$-the languages computable via a polynomial-time machine given one query to the jth level of the boolean hierarchy followed by one query to the kth level of the boolean hierarchy-equals $\redttnp{j+2k-1}$ if j is even and k is odd, and equals $\redttnp{j+2k}$ otherwise. Thus, unless the polynomial hierarchy collapses, it holds that for each $1\leq j \leq k$: $\pjk = \pkj \iff (j=k) \lor (j{is even} \land k=j+1)$. We extend our analysis to apply to more general query classes.

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

↑