71
Voted
COCO
2007
Springer
15 years 23 days ago
2007
Springer
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...