FOCS
2009
IEEE
14 years 5 months ago
2009
IEEE
FOCS
2009
IEEE
14 years 5 months ago
2009
IEEE
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
FOCS
2009
IEEE
14 years 5 months ago
2009
IEEE
FOCS
2009
IEEE
14 years 5 months ago
2009
IEEE
Abstract— Under CPA and CCA1 attacks, a secure bit encryption scheme can be applied bit-by-bit to construct a secure many-bit encryption scheme. The same construction fails, howe...
FOCS
2009
IEEE
14 years 5 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
FOCS
2009
IEEE
14 years 5 months ago
2009
IEEE
We provide a full characterization of applicability of The Local Consistency Checking algorithm to solving the non-uniform Constraint Satisfaction Problems. This settles the conje...