✦ LIBER ✦

A coding problem for pairs of subsets

✍ Scribed by Gyula O.K. Katona

Book ID: 104444436
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 229 KB
Volume: 15
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00593-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Subsets with a Small Sum II: the Critica

Subsets with a Small Sum II: the Critical Pair Problem

✍ Yahya Ould Hamidoune 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 102 KB

A genetic algorithm for subset sum probl

A genetic algorithm for subset sum problem

✍ Rong Long Wang 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 173 KB

An extremal problem for antichains of su

An extremal problem for antichains of subsets of a multiset

✍ G.F. Clements 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 850 KB

A multiset M is a finite set consisting of several different kinds of elements, and an antichain F is a set of incomparable subsets of M. With P and \_F denoting respectively the set of subsets which contain an element of F or are contained in an element of F, we find the best upper bound for min(lF

The Critical Pairs of Subsets of a Group

The Critical Pairs of Subsets of a Group of Prime Order

✍ Vosper, A. G. 📂 Article 📅 1956 🏛 Oxford University Press 🌐 English ⚖ 171 KB

Rank distance problem for pairs of matri

Rank distance problem for pairs of matrices

✍ Dodig, Marija 📂 Article 📅 2012 🏛 Taylor and Francis Group 🌐 English ⚖ 142 KB

The maximum number of disjoint pairs in

The maximum number of disjoint pairs in a family of subsets

✍ N. Alon; P. Frankl 📂 Article 📅 1985 🏛 Springer Japan 🌐 English ⚖ 387 KB