85 search results - page 14 / 17 » stoc 2009 |
94
Voted
TCC
2009
Springer
16 years 1 months ago
2009
Springer
We address one of the foundational problems in cryptography: the bias of coin-flipping protocols. Coin-flipping protocols allow mutually distrustful parties to generate a common u...
101
Voted
COCO
2009
Springer
15 years 7 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
94
Voted
CRYPTO
2010
Springer
15 years 27 days ago
2010
Springer
Coin-tossing protocols are protocols that generate a random bit with uniform distribution. These protocols are used as a building block in many cryptographic protocols. Cleve [STOC...
103
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
105
click to vote
STOC
2009
ACM
16 years 1 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...