✦ LIBER ✦

Minimal complete sets of words

✍ Scribed by Jean Marie Boë; Aldo de Luca; Antonio Restivo

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 770 KB
Volume: 12
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(80)90062-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Limit sets for complete minimal immersio

Limit sets for complete minimal immersions

✍ Antonio Alarcón; Nikolai Nadirashvili 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 French ⚖ 207 KB

Minimal Completely Separating Systems of

Minimal Completely Separating Systems of k-Sets

✍ André Kündgen; Dhruv Mubayi; Prasad Tetali 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 117 KB

Let n and k be fixed positive integers. A collection C of k-sets of [n] is a completely separating system if, for all distinct i, j # [n], there is an S # C for which i # S and j Â S. Let R(n, k) denote the minimum size of such a C. Our results include showing that if n k is a sequence with k< 0, th

The set of minimal braids is co-NP-compl

The set of minimal braids is co-NP-complete

✍ M.S Paterson; A.A Razborov 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 835 KB

About prefix sets of words

✍ Véronique Bruyr̀e 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 315 KB

Unavoidable Sets of Partial Words

✍ F. Blanchet-Sadri; N. C. Brownstein; Andy Kalcic; Justin Palumbo; T. Weyand 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 503 KB

Commutation with Ternary Sets of Words

✍ Juhani Karhumäki; Michel Latteux; Ion Petre 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 177 KB