✦ LIBER ✦

On the Complexity of Negation-Limited Boolean Networks

✍ Scribed by Beals, Robert; Nishino, Tetsuro; Tanaka, Keisuke

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Negation-Limited Complexity of Parity an

✍ Kazuo Iwama; Hiroki Morizumi; Jun Tarui 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 333 KB

Negation-limited circuit complexity of s

✍ Keisuke Tanaka; Tetsuro Nishino; Robert Beals 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 710 KB

On the complexity of 2-output Boolean ne

✍ G. Galbiati; M.J. Fischer 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 991 KB

Quantifying the complexity of random Boo

✍ Gong, Xinwei; Socolar, Joshua E. S. 📂 Article 📅 2012 🏛 The American Physical Society 🌐 English ⚖ 279 KB

On the use of negation in Boolean IR que

✍ Shmuel T. Klein 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 476 KB

Complexity of monotone networks for Bool

✍ Michael S. Paterson 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 994 KB