Two Queries

作者:

Highlights:

摘要

We consider the question whether two queries SAT are as powerful as one query. We show that if PNP[1]=PNP[2] then: Locally either NP=coNP or NP has polynomial-size circuits; PNP=PNP[1]; Σp2⊆Πp2/1; Σp2=UPNP[1]∩RPNP[1]; PH=BPPNP[1]. Moreover, we extend the work of Hemaspaandra, Hemaspaandra, and Hempel to show that if PΣp2[1]=PΣp2[2] then Σp2=Πp2. We also give a relativized world, where PNP[1]=PNP[2], but NP≠coNP.

论文关键词:

论文评审过程:Received 16 August 1998, Revised 30 April 1999, Available online 25 May 2002.

论文官网地址:https://doi.org/10.1006/jcss.1999.1647