✦ LIBER ✦

An upper bound on the number of functions satisfying the Strict Avalanche Criterion

✍ Scribed by Luke O'Connor

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 258 KB
Volume: 52
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)00161-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds on the number of functions satisf

Bounds on the number of functions satisfying the Strict Avalanche Criterion

✍ Thomas W. Cusick 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 268 KB

An upper bound on the Ramsey number of t

An upper bound on the Ramsey number of trees

✍ András Gyárfás; Zsolt Tuza 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 66 KB

An upper bound on the path number of a d

An upper bound on the path number of a digraph

✍ Richard C O'Brien 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 431 KB

An improved upper bound on the crossing

An improved upper bound on the crossing number of the hypercube

✍ Luerbio Faria; Celina Miraglia Herrera de Figueiredo; Ondrej Sýkora; Imrich Vrt' 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB

## Abstract We draw the __n__‐dimensional hypercube in the plane with ${5\over 32}4^{n}-\lfloor{{{{n}^{2}+1}\over 2}}\rfloor {2}^{n-2}$ crossings, which improves the previous best estimation and coincides with the long conjectured upper bound of Erdös and Guy. © 2008 Wiley Periodicals, Inc. J Graph

An upper bound on the number of cliques

An upper bound on the number of cliques in a graph

✍ Martin Farber; Mihály Hujter; Zsolt Tuza 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 252 KB 👁 1 views

An upper bound on the Ramsey numbers R(3

An upper bound on the Ramsey numbers R(3, k)

✍ Jerrold R Griggs 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 372 KB