119
Voted
COCO
15 years 6 months ago
2006 Springer  137
click to vote
COCO
15 years 6 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...
97
Voted
COCO
15 years 6 months ago
2006 Springer  109
Voted
COCO
15 years 6 months ago
2006 Springer
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...
117
click to vote
COCO
15 years 6 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...
|
Algorithms