A lower bound on the length of a sequence containing all permutations as subsequences
type: Item
instance of: scholarly article
title: A lower bound on the length of a sequence containing all permutations as subsequences
zbMATH Open document ID: 0333.05003
DOI: 10.1016/0097-3165(76)90057-1
author: Daniel J. Kleitman
author: D. J. Kwiatkowski
published in: Journal of Combinatorial Theory. Series A
publication date: 1976-01-01T00:00:00Z
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05B99
Mathematics Subject Classification ID: 05A15
zbMATH DE Number: 3520416
MaRDI profile type: Publication
full work available at URL: 0097-3165(76)90057-1
OpenAlex ID: W2079303095
cites work: On Permutation-Embedding Sequences
cites work: Shortest string containing all permutations
cites work: Short permutation strings
description: scientific article; zbMATH DE number 3520416