✦ LIBER ✦

The lower bound of the number of inequalities which represent a monotonic boolean function of n variables

✍ Scribed by Yu.A. Zuev; V.N. Trishin

Publisher: Elsevier Science
Year: 1983
Weight: 112 KB
Volume: 23
Category: Article
ISSN: 0041-5553
DOI: 10.1016/s0041-5553(83)80118-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A 3n-lower bound on the network complexi

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

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

A new lower bound on the monotone networ

A new lower bound on the monotone network complexity of Boolean sums

✍ Ingo Wegener 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 282 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__

Computer experiments to find the minimum

Computer experiments to find the minimum lower unity of a monotone Boolean function

✍ V.G. Ustyuzhaninov 📂 Article 📅 1990 🏛 Elsevier Science ⚖ 723 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 New Lower Bound on the Number of Odd V

A New Lower Bound on the Number of Odd Values of the Ordinary Partition Function

✍ Dennis Eichhorn 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 226 KB