✦ LIBER ✦

On the complexity of Boolean functions computed by lazy oracles

✍ Scribed by Dunne, P.E.; Leng, P.H.; Nwana, G.F.

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

Complexity of sequential computations of

✍ L. A. Sholomov 📂 Article 📅 2008 🏛 Pleiades Publishing 🌐 English ⚖ 785 KB

An improved complexity hierarchy on the

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

On the Computational Complexity of Some

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

On the complexity of Boolean functions w

✍ Redkin, N. P. 📂 Article 📅 2004 🏛 Walter de Gruyter GmbH & Co. KG 🌐 English ⚖ 86 KB

On Complexity of Computation of Partial

✍ A.N. Alekseichuk 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 49 KB