✦ LIBER ✦

An asymptotic bound for the complexity of monotone graph properties

✍ Scribed by Torsten Korneffel; Eberhard Triesch

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Ω(n4/3) lower bound on the randomized

✍ Péter Hajnal 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 657 KB

An Ω(n5/4) lower bound on the randomized

✍ Valerie King 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 546 KB

A bound for the complexity of a simple g

✍ Robert Grone; Russell Merris 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 310 KB

Let G be a simple (nonfat graph wiih degree sequeme dl, dz, l . . , d,. The ~~~~~ of spanning trees of G is bounded above by

An Ω(n43) lower bound on the monotone ne

✍ Norbert Blum 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 510 KB

Logic vs. complexity theoretic propertie

✍ Christoph Meinel 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 344 KB

An upper bound for the complexity of tra

✍ Stuart W Margolis; Bret Tilson 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 759 KB