✦ LIBER ✦

An improved complexity hierarchy on the depth of Boolean functions

✍ Scribed by Ingo Wegener

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the combinational complexity of certa

✍ Larry J. Stockmeyer 📂 Article 📅 1976 🏛 Springer 🌐 English ⚖ 757 KB

On the Computational Complexity of Some

✍ B. Borchert; D. Ranjan; F. Stephan 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 193 KB

A 3n-lower bound on the network complexi

✍ C.P. Schnorr 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 972 KB

On the complexity of analysis and manipu

✍ Jordan Gergov; Christoph Meinel 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 590 KB

On lower bounds for the complexity of di

✍ A.Yu. Kogan 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 510 KB

On one criterion of the optihality of an

✍ D.N. Gainanov 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 599 KB