Explicit Constructions of Rödl's Asymptotically Good Packings and Coverings

Autor:	N. N. Kuzjurin
Rok vydání:	2000
Předmět:	Statistics and Probability Combinatorics Discrete mathematics Set (abstract data type) Polynomial Computational Theory and Mathematics Spacetime Applied Mathematics Natural number Theoretical Computer Science Mathematics
Zdroj:	Combinatorics, Probability and Computing. 9:265-276
ISSN:	1469-2163 0963-5483
DOI:	10.1017/s0963548300004235
Popis:	For any fixed l < k we present families of asymptotically good packings and coverings of the l-subsets of an n-element set by k-subsets, and an algorithm that, given a natural number i, finds the ith k-subset of the family in time and space polynomial in log n.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::50c7f0ebabc7324ee6fbce86e79fb48d https://doi.org/10.1017/s0963548300004235 Zobrazit plný text záznamu