𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower estimates of circuit complexity in the basis of antichain functions

✍ Scribed by O. V. Podol’skaya

Book ID
120894540
Publisher
Allerton Press Inc
Year
2013
Tongue
English
Weight
411 KB
Volume
68
Category
Article
ISSN
0027-1322

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound on the size of a complex g
A lower bound on the size of a complex generated by an antichain
✍ P. Frankl 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 427 KB

A short proof of the following result of Kleitman is given: the total number of sets contained in some member of an antichain of size (i) over the n-set is at least (E) + l --+ (i) for 0 < k G in. An equally short proof of Harper's isoperimetric theorem is provided as well.