Sciweavers

COCO
1998
Springer
93views Algorithms» more  COCO 1998»
13 years 9 months ago
Resource Bounded Measure and Learnability
We consider the resource bounded measure of polynomial-time learnable subclasses of polynomial-size circuits. We show that if EXP 6= MA, then every PAClearnable subclass of P=poly...
Wolfgang Lindner, Rainer Schuler, Osamu Watanabe