COCO
2006
Springer
14 years 9 months ago
2006
Springer
COCO
2006
Springer
14 years 9 months ago
2006
Springer
Let C be a class of distributions over {0, 1}n . A deterministic randomness extractor for C is a function E : {0, 1}n {0, 1}m such that for any X in C the distribution E(X) is sta...
COCO
2006
Springer
14 years 9 months ago
2006
Springer
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
COCO
2006
Springer
14 years 9 months ago
2006
Springer
COCO
2006
Springer
14 years 9 months ago
2006
Springer
We provide the first hardness result for the Covering Radius Problem on lattices (CRP). Namely, we show that for any large enough p there exists a constant cp > 1 such that C...
COCO
2006
Springer
14 years 9 months ago
2006
Springer
COCO
2006
Springer
14 years 9 months ago
2006
Springer
COCO
2006
Springer
14 years 9 months ago
2006
Springer
COCO
2006
Springer
14 years 9 months ago
2006
Springer
We establish a close connection between (sub)exponential time complexity and parameterized complexity by proving that the so-called miniaturization mapping is a reduction preservi...
COCO
2006
Springer
14 years 9 months ago
2006
Springer
We consider the relationship between the complexities of - and those of restricted to formulas of constant density. Let be the infimum of those such that - on variables can be dec...