A lower bound on the length of a sequence containing all permutations as subsequences
- 1 September 1976
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 21 (2) , 129-136
- https://doi.org/10.1016/0097-3165(76)90057-1
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Shortest string containing all permutationsDiscrete Mathematics, 1975
- Short permutation stringsDiscrete Mathematics, 1974