3 search results - page 1 / 1 » Circuit Lower Bounds, Help Functions, and the Remote Point P... |
ICS
2010
Tsinghua U.
14 years 1 months ago
2010
Tsinghua U.
FOCS
1994
IEEE
13 years 8 months ago
1994
IEEE
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...
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...