2924 search results - page 26 / 585 » Lower Bounds in Distributed Computing |
178
Voted
ICCV
2001
IEEE
16 years 9 months ago
2001
IEEE
158
Voted
WG
2001
Springer
15 years 11 months ago
2001
Springer
172
Voted
ALT
2010
Springer
15 years 9 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...
203
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
166
Voted
LICS
2008
IEEE
16 years 1 months ago
2008
IEEE