✦ LIBER ✦

A lower bound on the length of a sequence containing all permutations as subsequences

✍ Scribed by D.J Kleitman; D.J Kwiatkowski

Book ID: 107884831
Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 524 KB
Volume: 21
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(76)90057-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new bound on the length of the shortes

A new bound on the length of the shortest string containing all r-permutations

✍ Cai Mao-cheng 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 196 KB

The purpose of this note is to give a new upper bound of the shortest string containing all r-permutations. Thus we disprove the conjecture considered in Cl]. The terminology used in this note fullows [I]. Koutas and Nu [I] proposed the foIlowing problem of constructing a shortest string of (1, 2,

A lower bound on the area of permutation

A lower bound on the area of permutation layouts

✍ Alok Aggarwal; Maria Klawe; David Lichtenstein; Nathan Linial; Avi Wigderson 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 846 KB

A lower bound on the period length of a

A lower bound on the period length of a distributed scheduler

✍ Yossi Malka; Shlomo Moran; Shmuel Zaks 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 886 KB

A lower bound on the expected length of

A lower bound on the expected length of one-to-one codes

✍ Alon, N.; Orlitsky, A. 📂 Article 📅 1994 🏛 IEEE 🌐 English ⚖ 273 KB

A Polynomial Lower Bound on the Size of

A Polynomial Lower Bound on the Size of ak-Min-Wise Independent Set of Permutations

✍ S. A. Norin 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 138 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