Sciweavers

50 search results - page 1 / 10
» On the Computational Complexity of Coin Flipping
Sort
View
FOCS
2010
IEEE
13 years 3 months ago
On the Computational Complexity of Coin Flipping
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...
Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai
COLT
2004
Springer
13 years 8 months ago
The Budgeted Multi-armed Bandit Problem
straction of the following scenarios: choosing from among a set of alternative treatments after a fixed number of clinical trials, determining the best parameter settings for a pro...
Omid Madani, Daniel J. Lizotte, Russell Greiner
FOCS
2009
IEEE
13 years 9 months ago
Optimal Quantum Strong Coin Flipping
Coin flipping is a fundamental cryptographic primitive that enables two distrustful and far apart parties to create a uniformly random bit [Blu81]. Quantum information allows for ...
André Chailloux, Iordanis Kerenidis
CORR
2010
Springer
68views Education» more  CORR 2010»
13 years 5 months ago
Can Random Coin Flips Speed Up a Computer?
David Zuckerman