✦ LIBER ✦

On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions

✍ Scribed by B. Borchert; D. Ranjan; F. Stephan

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

An improved complexity hierarchy on the

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

A 3n-lower bound on the network complexi

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

On the Equivalence of Some Conditions fo

✍ S. Yu. Tikhonov 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 208 KB

On the pairs of multiplicative functions

✍ N. L. Bassily; I. Kátai 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 362 KB

On some relations which are equivalent t

✍ Fritz Oberhettinger; Kusum L. Soni 📂 Article 📅 1972 🏛 Springer-Verlag 🌐 French ⚖ 707 KB