On Approximate Majority and Probabilistic Time

We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away from 1/2 (by a constant). We then apply these results to obtain new relationships between probabilistic time, BPTime (t), and alternating time, O(1)Time (t). Our main results are the following:

• Type: Conference
• Year: 2007
• Where: COCO
• Authors: Emanuele Viola
• Keywords: Algorithms, Approximate Majority, Bit String, Circuit Complexity, COCO 2007