80 search results - page 6 / 16 » stoc 2007 |
STOC
2007
ACM
16 years 4 months ago
2007
ACM
: Consider a game where a referee chooses (x,y) according to a publicly known distribution, sends x to Alice, and y to Bob. Without communicating with each other, Alice responds wi...
142
Voted
STOC
2007
ACM
16 years 4 months ago
2007
ACM
We study linear programming relaxations of Vertex Cover and Max Cut arising from repeated applications of the "lift-and-project" method of Lovasz and Schrijver starting ...
151
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
A distributed consensus algorithm allows n processes to reach a common decision value starting from individual inputs. Wait-free consensus, in which a process always terminates wi...
140
Voted
STOC
2007
ACM
16 years 4 months ago
2007
ACM
In this paper we consider the problem of constructing a small arithmetic circuit for a polynomial for which we have oracle access. Our focus is on n-variate polynomials, over a fi...
117
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
In the all-pairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real non-negative capacities on its edges and is aske...