Error-bounded probabilistic computations between MA and AM

  • Authors:

  • Elmar Böhler;Christian Glaßer;Daniel Meister

  • Affiliations:

  • Lehrstuhl für Informatik IV, Universität Würzburg, Würzburg, Germany;Lehrstuhl für Informatik IV, Universität Würzburg, Würzburg, Germany;Lehrstuhl für Informatik IV, Universität Würzburg, Würzburg, Germany

  • Venue:
  • Journal of Computer and System Sciences
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce the probabilistic class SBP. This class emerges from BPP by keeping the promise of a probability gap but decreasing the probability limit from 1/2 to exponentially small values. We show that SBP is in the polynomial-time hierarchy, between MA and AM on the one hand and between BPP and BPPpath on the other hand. We provide evidence that SBP does not coincide with these and other known complexity classes. In particular, in a suitable relativized world SBP is not contained in Σ2P. In the same world, BPPpath is not contained in Σ2P, which solves an open question raised by Han, Hemaspaandra, and Thierauf. We study the question of whether SBP has many-one complete sets. We relate this question to the existence of uniform enumerations and construct an oracle relative to which SBP and AM do not have many-one complete sets. We introduce the operator SB. and prove that, for any class C with certain properties, BP ċ ∃ ċ C contains every class defined by applying an operator sequence over {Uċ, ∃ċ, BPċ, SBċ} to C.