Sciweavers

COCO
2008
Springer
91views Algorithms» more  COCO 2008»
14 years 1 months ago
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] = ...
Richard Chang, Suresh Purini