115
click to vote
ALT
2010
Springer
15 years 4 months ago
2010
Springer
We show that random DNF formulas, random log-depth decision trees and random deterministic finite acceptors cannot be weakly learned with a polynomial number of statistical queries...