✦ LIBER ✦

A lower bound for the computational complexity of a set of disjunctives in a monotone basis

✍ Scribed by D. Yu. Grigor'ev

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new lower bound on the monotone networ

✍ Ingo Wegener 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 282 KB

The computational complexity of a set of

✍ Joseph Ja'Ja' 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 582 KB

A lower bound on the computational compl

✍ Eric Goles; Marcos Kiwi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 483 KB

Lower bounds on monotone complexity of t

✍ A. A. Razborov 📂 Article 📅 1985 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 619 KB

A lower bound for the topological comple

✍ Harold Levine 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 646 KB

A lower bound for the complexity of Crai

✍ Mundici, Daniele 📂 Article 📅 1983 🏛 Springer-Verlag ⚖ 532 KB