STOC
2006
ACM
14 years 12 months ago
2006
ACM
STOC
2006
ACM
14 years 12 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
STOC
2006
ACM
14 years 12 months ago
2006
ACM
STOC
2006
ACM
14 years 12 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 ...
STOC
2006
ACM
14 years 12 months ago
2006
ACM
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
STOC
2006
ACM
14 years 12 months ago
2006
ACM
STOC
2006
ACM
14 years 12 months ago
2006
ACM
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
STOC
2006
ACM
14 years 12 months ago
2006
ACM
STOC
2006
ACM
14 years 12 months ago
2006
ACM
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
STOC
2006
ACM
14 years 12 months ago
2006
ACM
In this paper, we improve a recent result of Daskalakis, Goldberg and Papadimitriou on PPAD-completeness of 4-Nash, showing that 3-Nash is PPAD-complete.