240 search results - page 1 / 48 » Deterministic Approximation Algorithms for the Nearest Codew... |
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
FOCS
2005
IEEE
13 years 10 months ago
2005
IEEE
d Abstract] Mikhail Alekhnovich ∗ Subhash A. Khot † Guy Kindler ‡ Nisheeth K. Vishnoi § We show that, unless NP⊆DTIME(2poly log(n) ), the closest vector problem with pre-...
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
SODA
2000
ACM
13 years 6 months ago
2000
ACM
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...