𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A simple lower bound for monotone clique using a communication game

✍ Scribed by Mikael Goldmann; Johan Håstad


Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
436 KB
Volume
41
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


An Exponential Lower Bound for the Size
✍ Armin Haken; Stephen A. Cook 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 118 KB

We prove a lower bound, exponential in the eighth root of the input length, on the size of monotone arithmetic circuits that solve an NP problem related to clique detection. The result is more general than the famous lower bound of Razborov and Andreev, because the gates of the circuit are allowed t

Bearing capacity factors of circular fou
✍ Jyant Kumar; Vishwas N. Khatri 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

## Abstract By using the lower bound limit analysis in conjunction with finite elements and linear programming, the bearing capacity factors due to cohesion, surcharge and unit weight, respectively, have been computed for a circular footing with different values of ϕ. The recent axisymmetric formul