STOC
2002
ACM
14 years 12 months ago
2002
ACM
Let f : {0, 1}n {0, 1} be a boolean function. For 0 let D (f) be the minimum depth of a decision tree for f that makes an error for fraction of the inputs x {0, 1}n . We also ma...