𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Exact VC-dimension of Boolean monomials

✍ Scribed by Thomas Natschläger; Michael Schmitt

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
166 KB
Volume
59
Category
Article
ISSN
0020-0190

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

Sperner families of bounded VC-dimension
Sperner families of bounded VC-dimension
✍ R.P. Anstee; A. Sali 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 344 KB

We explore a problem of Frankl (1989). A family ~ of subsets of {1, 2, ..., m} is said to have trace Kk if there is a subset SC\_{1,2 ..... m} with IS] = k so that {FNSIF C .~} yields all 2 k possible subsets. Frankl (1989) conjectured that a family ~ which is an antichain (in poser given by C\_ ord

Finitistic dimension of monomial algebra
Finitistic dimension of monomial algebras
✍ Hongbo Shi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 126 KB

The minimal projective resolution of the left ideal generated by any monomial p in a monomial algebra is described by a combinatorial object, the dimension tree of p. Two algorithms are proposed for computing the desired dimension trees. Determination of finitistic dimensions is then given as one of

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