| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429226 | Information Processing Letters | 2007 | 4 Pages |
Abstract
The known O(dklogk) bound on the VC dimension of k-fold unions or intersections of a given concept class with VC dimension d is shown to be asymptotically tight.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
