✦ LIBER ✦

A Lower Bound on the Complexity of Arbitrary Switching Function Realizers

✍ Scribed by Hansalik, W.E.

Book ID: 114587982
Publisher: IEEE
Year: 1972
Tongue: English
Weight: 548 KB
Volume: C-21
Category: Article
ISSN: 0018-9340
DOI: 10.1109/t-c.1972.223552

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximizing a lower bound on the computat

Maximizing a lower bound on the computational complexity

✍ Georg Gati 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 294 KB

A lower bound on the independence number

A lower bound on the independence number of arbitrary hypergraphs

✍ Thiele, Torsten 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 104 KB 👁 3 views

We present a lower bound on the independence number of arbitrary hypergraphs in terms of the degree vectors. The degree vector of a vertex v is given by d is the number of edges of size m containing v. We define a function f with the property that any hypergraph H = (V, E) satisfies α(H) ≥ v∈V f (d

A nonlinear lower bound on the practical

A nonlinear lower bound on the practical combinational complexity

✍ Xaver Gubáš; Juraj Hromkovič; Juraj Waczulík 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 558 KB

A 4n-lower bound on the monotone network

A 4n-lower bound on the monotone network complexity of a one-output boolean function

✍ Jürgen Tiekenheinrich 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 79 KB

A lower bound for the edit-distance prob

A lower bound for the edit-distance problem under an arbitrary cost function

✍ Xiaoqiu Huang 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 246 KB

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