85 search results - page 6 / 17 » stoc 2009 |
STOC
2009
ACM
16 years 1 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
130
click to vote
STOC
2009
ACM
16 years 1 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
102
click to vote
STOC
2009
ACM
16 years 1 months ago
2009
ACM
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
101
click to vote
STOC
2009
ACM
16 years 1 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
126
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
We study a general sub-class of concave games, which we call socially concave games. We show that if each player follows any no-external regret minimization procedure then the dyn...