✦ LIBER ✦

Bounds on the number of functions satisfying the Strict Avalanche Criterion

✍ Scribed by Thomas W. Cusick

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 268 KB
Volume: 57
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(95)00211-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound on the number of function

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

✍ Luke O'Connor 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 258 KB

Improving the strict avalanche character

Improving the strict avalanche characteristics of cryptographic functions

✍ Jennifer Seberry; Xian-Mo Zhang; Yuliang Zheng 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 419 KB

On a class of functions satisfying the L

On a class of functions satisfying the Lipschitz condition

✍ G.N.Keshava Murthy; K.R Unni 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 190 KB

Bounds on the number of complete subgrap

Bounds on the number of complete subgraphs

✍ David C. Fisher; Jennifer Ryan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 385 KB

Fisher, D.C. and J. Ryan, Bounds on the number of complete subgraphs, Discrete Mathematics 103 (1992) 313-320. Let G be a graph with a clique number w. For 1 s s w, let k, be the number of complete j subgraphs on j nodes. We show that k,,, c (j~l)(kj/(~))u""'. This is exact for complete balanced w-

Bounds for the Postulation Numbers of Hi

Bounds for the Postulation Numbers of Hilbert Functions

✍ Niels Schwartz 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 356 KB

Bounds on the bondage number of a graph

✍ Bert L. Hartnell; Douglas F. Rall 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 317 KB

The bondage number b(G) of a graph G is the minimum cardinality of a set of edges of G whose removal from G results in a graph with domination number larger than that of G. Several new sharp upper bounds for b(G) are established. In addition, we present an infinite class of graphs each of whose bond