2 search results - page 1 / 1 » Amplifying ZPP^SAT[1] and the Two Queries Problem |
COCO
2008
Springer
13 years 6 months ago
2008
Springer
![Amplifying ZPP^SAT[1] and the Two Queries Problem](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Amplifying ZPP^SAT[1] and the Two Queries Problem")
This paper shows a complete upward collapse in the Polynomial Hierarchy (PH) if for ZPP, two queries to a SAT oracle is equivalent to one query. That is, ZPPSAT[1] = ZPPSAT [2] = ...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...