✦ LIBER ✦

A 3n-lower bound on the network complexity of Boolean functions

✍ Scribed by C.P. Schnorr

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 972 KB
Volume: 10
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(80)90074-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds on the area complexity of B

Lower bounds on the area complexity of Boolean circuits

✍ Juraj Hromkovič; Sergej A. Ložkin; Andrej I. Rybko; Alexander A. Sapoženko; Nade 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 1001 KB

A new lower bound on the expected size o

A new lower bound on the expected size of irredundant forms for Boolean functions

✍ Luke O'Connor 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 455 KB

An Ω(n43) lower bound on the monotone ne

An Ω(n43) lower bound on the monotone network complexity of the nth degree convolution

✍ Norbert Blum 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 510 KB

On lower bounds for the complexity of di

On lower bounds for the complexity of disjunctive normal forms of Boolean functions with a small number of zeros

✍ A.Yu. Kogan 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 510 KB

A lower bound on the number of Semi-Bool

A lower bound on the number of Semi-Boolean quadruple systems

✍ Marco Buratti; Alberto Del Fra 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB 👁 1 views

## Abstract A Steiner quadruple system of order 2^__n__^ is __Semi‐Boolean__ (SBQS(2^__n__^) in short) if all its derived triple systems are isomorphic to the point‐line design associated with the projective geometry __PG__(__n__−1, 2). We prove by means of explicit constructions that for any __n__

On the lower bound of mazur for autocorr

On the lower bound of mazur for autocorrelation functions. Ergodicity

✍ M. Sirugue; A. Verbeure 📂 Article 📅 1973 🏛 Elsevier Science ⚖ 309 KB