✦ LIBER ✦

On the complexity of 2-output Boolean networks

✍ Scribed by G. Galbiati; M.J. Fischer

Book ID: 107948480
Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 991 KB
Volume: 16
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(81)90074-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Complexity of Negation-Limited Bo

On the Complexity of Negation-Limited Boolean Networks

✍ Beals, Robert; Nishino, Tetsuro; Tanaka, Keisuke 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 295 KB

Quantifying the complexity of random Boo

Quantifying the complexity of random Boolean networks

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

A 4n-lower bound on the monotone network

A 4n-lower bound on the monotone network complexity of a one-output boolean function

✍ Jürgen Tiekenheinrich 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 79 KB

Complexity of monotone networks for Bool

Complexity of monotone networks for Boolean matrix product

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

Reviews of Nonlinear Dynamics and Comple

Reviews of Nonlinear Dynamics and Complexity || Random Boolean Networks

✍ Schuster, Heinz Georg 📂 Article 📅 2008 🏛 Wiley-VCH Verlag GmbH & Co. KGaA 🌐 German ⚖ 511 KB

Nonlinear behaviour is ubiquitous in nature and the interdisciplinary field of Nonlinear Dynamics and complexity consists of a large body of theoretical and experimental work wit many applications. It is the aim of these new series to provide reviews of Nonlinear Dynamics and Complexity where resear

On the complexity of planar Boolean circ

On the complexity of planar Boolean circuits

✍ György Turán 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 1006 KB