2996 search results - page 406 / 600 » Numberings and Randomness |
173
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
209
click to vote
ICDCS
2008
IEEE
16 years 1 months ago
2008
IEEE
A multi-object operation incurs communication or synchronization overhead when the requested objects are distributed over different nodes. The object pair correlations (the probab...
175
click to vote
FOCS
2007
IEEE
16 years 29 days ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
146
click to vote
INFOCOM
2007
IEEE
16 years 28 days ago
2007
IEEE
We consider the problem of reliable broadcast in a wireless network in which nodes are prone to failure. In the failure mode considered in this paper, each node can fail independe...
160
click to vote
MFCS
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. We study the existence and tractability of a notion of approximate equilibria in bimatrix games, called well supported approximate Nash Equilibria (SuppNE in short). We p...