Titlebook: Mathematical Foundations of Computer Science 2003; 28th International S Branislav Rovan,Peter Vojtá? Conference proceedings 2003 Springer-V

declamation

Grasping

Error-Bounded Probabilistic Computations between MA and AMility limit to exponentially small values. We locate SBP in the polynomial-time hierarchy, more precisely, between MA and AM. We provide evidence that SBP does not coincide with these and other known complexity classes. We construct an oracle relative to which SBP is not contained in ...We provide a