<--- Back to Details
First PageDocument Content
Computational complexity theory / Probably approximately correct learning / Time complexity / VC dimension / P / Decision tree model / Inductive inference / Theoretical computer science / Applied mathematics / Computational learning theory
Date: 2003-09-30 03:15:45
Computational complexity theory
Probably approximately correct learning
Time complexity
VC dimension
P
Decision tree model
Inductive inference
Theoretical computer science
Applied mathematics
Computational learning theory

A Booster for the PAExact model Nader H. Bshouty

Add to Reading List

Source URL: www.cs.technion.ac.il

Download Document from Source Website

File Size: 257,08 KB

Share Document on Facebook

Similar Documents