Better Lower Bounds for Monotone Thresho
✍
Jaikumar Radhakrishnan
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 670 KB
We show that every monotone formula that computes the threshold function TH k, n , 2 k nÂ2, has size at least wkÂ2x n log(nÂ(k&1)). The same lower bound is shown to hold in the stronger monotone directed contact networks model.