Join Our Newsletter

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

FOCS

2010

IEEE

2010

IEEE

The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this coin, and the goal is to guess which way the coin is biased, and to answer correctly with probability 2/3. When our computational model is unrestricted, the majority function is optimal, and succeeds when c/ n for a large enough constant c. The coin problem is open and interesting in models that cannot compute the majority function. In this paper we study the coin problem in the model of read-once width-w branching programs. We prove that in order to succeed in this model, must be at least 1/(log n)(w) . For constant w this is tight by considering the recursive tribes function, and for other values of w this is nearly tight by considering other read-once AND-OR trees. We generalize this to a Dice Problem, where instead of independent tosses of a coin we are given independent tosses of one of two m-sided di...

Added |
11 Feb 2011 |

Updated |
11 Feb 2011 |

Type |
Journal |

Year |
2010 |

Where |
FOCS |

Authors |
Joshua Brody, Elad Verbin |

Comments (0)