✦ LIBER ✦

Compositional complexity of Boolean functions

✍ Scribed by Harold Abelson; Andrzej Ehrenfeucht; James Fickett; Jan Mycielski

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity hierarchies for Boolean funct

✍ William F. McColl 📂 Article 📅 1978 🏛 Springer-Verlag 🌐 English ⚖ 241 KB

The Complexity of Boolean Functions in D

✍ Parikshit Gopalan; Amir Shpilka; Shachar Lovett 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 573 KB

On the combinational complexity of certa

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

Complexity of single dynamic tests for m

✍ V. A. Vardanyan 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 352 KB

An improved complexity hierarchy on the

✍ Ingo Wegener 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 268 KB

The equivalence of Horn and network comp

✍ Stal O. Anderaa; Egon Börger 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 268 KB