More on BPP and the polynomial-time hierarchy

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)237-241
Number of pages5
JournalInformation Processing Letters
Volume57
Issue number5
DOIs
StatePublished - 11 Mar 1996
Externally publishedYes

Keywords

  • Computational complexity
  • Interactive proofs
  • Randomness
  • Theory of computation

Fingerprint

Dive into the research topics of 'More on BPP and the polynomial-time hierarchy'. Together they form a unique fingerprint.

Cite this