✦ LIBER ✦

Tight lower bounds on the length of word chains

✍ Scribed by Ingo Althöfer

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 113 KB
Volume: 34
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(90)90136-l

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tight Lower Bounds on the Size of Sweepi

Tight Lower Bounds on the Size of Sweeping Automata

✍ Hing Leung 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 124 KB

A lower bound for the length of addition

A lower bound for the length of addition chains

✍ Arnold Schönhage 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 516 KB

A tight lower bound on the maximum genus

A tight lower bound on the maximum genus of a simplicial graph

✍ Jianer Chen; Saroja P. Kanchi; Jonathan L. Gross 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 856 KB

It is proved that every connected simplicial graph with minimum valence at least three has maximum genus at least one-quarter of its cycle rank. This follows from the technical result that every 3-regular simplicial graph except K4 has a Xuong co-tree whose odd components have only one edge each. It

Lower bounds for the length of test sequ

Lower bounds for the length of test sequences using UIOs

✍ Marion Rodrigues; Hasan Ural 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 829 KB

A New Lower Bound on the Minimal Length

A New Lower Bound on the Minimal Length of a Binary Linear Code

✍ M.C. Bhandari; M.S. Garg 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 256 KB

A lower bound on the average shortest pa

A lower bound on the average shortest path length in regular graphs

✍ V. G. Cerf; D. D. Cowan; R. C. Mullin; R. G. Stanton 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 226 KB