Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

COCO
2007
Springer

favoriteEmaildiscussreport

94views Algorithms» more COCO 2007»

On Approximate Majority and Probabilistic Time

13 years 10 months ago

On Approximate Majority and Probabilistic Time

Download www.ccs.neu.edu

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:

Emanuele Viola

Real-time Traffic

Algorithms | Approximate Majority | Bit String | Circuit Complexity | COCO 2007 |

claim paper

Related Content

» Some Upper Bounds on Expected Agreement Time of a Probabilistic Local Majority Polling Gam...

» An Adaptive Version of the Boost by Majority Algorithm

» Probabilistic rough set approximations

» Selectivity Estimation using Probabilistic Models

» A contractivity approach for probabilistic bisimulations of diffusion processes

» Modeling and Analysis of Probabilistic Timed Systems

» Approximate Probabilistic Constraints and RiskSensitive Optimization Criteria in Markov De...

» Approximate Confidence Computation in Probabilistic Databases

» Approximate inference for planning in stochastic relational worlds

Post Info
More Details (n/a)

Added	14 Aug 2010
Updated	14 Aug 2010
Type	Conference
Year	2007
Where	COCO
Authors	Emanuele Viola

Comments (0)