Abstract
Sipser and GÃƒÂ¡cs, and independently Lautemann, proved in '83 that probabilistic polynomial time is contained in the second level of the polynomialtime hierarchy, i.e. BPP is in Sigma_2 P. This is essentially the only nontrivial upper bound that we have on the power of probabilistic computation. More precisely, the SipserGÃƒÂ¡csLautemann simulation shows that probabilistic time can be simulated deterministically, using two quantifiers, **with a quadratic blowup in the running time**. That is, BPTime(t) is contained in Sigma_2 Time(t^2).
In this talk we discuss whether this quadratic blowup in the running time is necessary. We show that the quadratic blowup is indeed necessary for blackbox simulations that use two quantifiers, such as those of Sipser, GÃƒÂ¡cs, and Lautemann. To obtain this result, we prove a new circuit lower bound for computing **approximate majority**, i.e. computing the majority of a given bitstring whose fraction of 1's is bounded away from 1/2 (by a constant): We show that small depth3 circuits for approximate majority must have bottom fanin Omega(log n).
On the positive side, we obtain that probabilistic time can be simulated deterministically, using three quantifiers, in quasilinear time. That is, BPTime(t) is contained in Sigma_3 Time(t polylog t). Along the way, we show that approximate majority can be computed by uniform polynomialsize depth3 circuits. This is a uniform version of a striking result by Ajtai that gives *nonuniform* polynomialsize depth3 circuits for approximate majority.
If time permits, we will discuss some applications of our results to proving lower bounds on randomized Turing machines.
BibTeX  Entry
@InProceedings{viola:DagSemProc.06111.11,
author = {Viola, Emanuele},
title = {{On Probabilistic Time versus Alternating Time}},
booktitle = {Complexity of Boolean Functions},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {18624405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2006/619},
URN = {urn:nbn:de:0030drops6194},
doi = {10.4230/DagSemProc.06111.11},
annote = {Keywords: Probabilistic time, alternating time, polynomialtime hierarchy, approximate majority, constantdepth circuit}
}
Keywords: 

Probabilistic time, alternating time, polynomialtime hierarchy, approximate majority, constantdepth circuit 
Collection: 

06111  Complexity of Boolean Functions 
Issue Date: 

2006 
Date of publication: 

30.11.2006 