Title :
On Approximate Majority and Probabilistic Time
Author_Institution :
Inst. for Adv. Study Princeton, Princeton
Abstract :
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, SigmaO(1)Time (t).
Keywords :
approximation theory; probability; alternating time; approximate majority; bit string; probabilistic time; Circuits; Complexity theory; Computational complexity; Computational modeling; Computer science; Logic; Mathematics; Polynomials; Turing machines; Upper bound;
Conference_Titel :
Computational Complexity, 2007. CCC '07. Twenty-Second Annual IEEE Conference on
Conference_Location :
San Diego, CA
Print_ISBN :
0-7695-2780-9
DOI :
10.1109/CCC.2007.16
