In this paper we present a new approximation algorithm for Unique Games. For a Unique Game with n vertices and k states (labels), if a (1 − ε) fraction of all constraints is sa...
Eden Chlamtac, Konstantin Makarychev, Yury Makaryc...
We prove that the function d : R3 × R3 → [0, ∞) given by d (x, y, z), (t, u, v) = (t − x)2 + (u − y)2 2 + (v − z + 2xu − 2yt)2 1 2 + (t − x)2 + (u − y)2 1 2 . is ...
We establish the exact threshold for the reconstruction problem for a binary asymmetric channel on the b-ary tree, provided that the asymmetry is sufficiently small. This is the ...
Christian Borgs, Jennifer T. Chayes, Elchanan Moss...
1 In this paper we show how descriptive markup technologies can help teachers in the production of learning content that later could be used for many different purposes with differ...
In this paper, we propose several methods to increase the difficulty of reverse engineering applications, with special emphasis on preventing the circumvention of copy protection ...