79 search results - page 10 / 16 » stoc 2006 |
135
Voted
STOC
2006
ACM
16 years 4 months ago
2006
ACM
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
143
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
134
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
In this paper, we present a simple distributed algorithm for resource allocation which simultaneously approximates the optimum value for a large class of objective functions. In p...
139
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
124
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...