Evolvability from learning algorithms
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A lower bound for agnostically learning disjunctions
COLT'07 Proceedings of the 20th annual conference on Learning theory
Unbounded-error classical and quantum communication complexity
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A complete characterization of statistical query learning with applications to evolvability
Journal of Computer and System Sciences
Hi-index | 0.00 |
There exists a positive constant \alpha \le 1 such that for any function T(n)\leqslant n^{\alpha} and for any problem L \in BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time which decides L, except for at most a 2^{-\Omega ...