๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The VC dimension of constraint-based grammars

โœ Scribed by Max Bane; Jason Riggle; Morgan Sonderegger

Book ID
116721560
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
389 KB
Volume
120
Category
Article
ISSN
0024-3841

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The VC-Dimension of Sperner Systems
The VC-Dimension of Sperner Systems
โœ G. Greco ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 119 KB

A family F of subsets of a finite set X shatters a set D X, if the intersections of the members of F with D coincide with the power set of D. The maximum size of a set shattered by F is the VC-dimension (or density) of the system. P. Frankl (1983, J. Combin. Theory Ser. A 34, 41 45) investigates the

The VC dimension of k-fold union
The VC dimension of k-fold union
โœ David Eisenstat; Dana Angluin ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 114 KB
On the complexity of approximating the V
On the complexity of approximating the VC dimension
โœ Elchanan Mossel; Christopher Umans ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 181 KB

We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is: 3 -hard to approximate to within a factor 2 ร€ e for all e > 0; \* approximable in AM to within a factor 2; and \* AM-hard to appr