83 search results - page 14 / 17 » Extractors: optimal up to constant factors |
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
We show a tight relation between the behavior of unique games under parallel repetition and their semidefinite value. Let G be a unique game with alphabet size k. Suppose the semid...
91
Voted
SPIRE
2010
Springer
14 years 10 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
101
click to vote
ADHOCNOW
2010
Springer
14 years 9 months ago
2010
Springer
A set of sensors establishes barrier coverage of a given line segment if every point of the segment is within the sensing range of a sensor. Given a line segment I, n mobile sensor...
94
Voted
CORR
2010
Springer
14 years 6 months ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
111
Voted
COR
2011
14 years 6 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...