✦ LIBER ✦

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

✍ Scribed by Luke O'Connor

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 455 KB
Volume: 53
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)00211-g

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal lower bounds on the depth of pol

Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions

✍ Ingo Wegener 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 176 KB

A new lower bound for the critical proba

A new lower bound for the critical probability of site percolation on the square lattice

✍ J. van den Berg; A. Ermakov 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 705 KB

The critical probability for site percolation on the square lattice is not known exactly. Several authors have given rigorous upper and lower bounds. Some recent lower bounds are (each displayed here with the first three digits) 0.503 (Toth [13]), 0.522 (Zuev [15]), and the best lower bound so far,