TY - JOUR
T1 - More on BPP and the polynomial-time hierarchy
AU - Canetti, Ran
N1 - Funding Information:
’ Email: [email protected]. Supported by grant No. 92-00226 from the United States-Israel Binational Science Foundation (BSF), Jerusalem, Israel.
PY - 1996/3/11
Y1 - 1996/3/11
N2 - We simplify known proofs that BPP lies within the Polynomial-time Hierarchy. Furthermore, our simple proof shows that BPP is contained in a complexity class that presumably lies even lower in this Hierarchy than was previously known. Our technique also simplifies the proof that one-sided-error IP equals two-sided-error IP.
AB - We simplify known proofs that BPP lies within the Polynomial-time Hierarchy. Furthermore, our simple proof shows that BPP is contained in a complexity class that presumably lies even lower in this Hierarchy than was previously known. Our technique also simplifies the proof that one-sided-error IP equals two-sided-error IP.
KW - Computational complexity
KW - Interactive proofs
KW - Randomness
KW - Theory of computation
UR - http://www.scopus.com/inward/record.url?scp=0000560640&partnerID=8YFLogxK
U2 - 10.1016/0020-0190(96)00016-6
DO - 10.1016/0020-0190(96)00016-6
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0000560640
SN - 0020-0190
VL - 57
SP - 237
EP - 241
JO - Information Processing Letters
JF - Information Processing Letters
IS - 5
ER -