The lexicographically smallest universal cycle for binary strings with minimum specified weight (Q405571)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The lexicographically smallest universal cycle for binary strings with minimum specified weight |
scientific article; zbMATH DE number 6340539
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The lexicographically smallest universal cycle for binary strings with minimum specified weight |
scientific article; zbMATH DE number 6340539 |
Statements
The lexicographically smallest universal cycle for binary strings with minimum specified weight (English)
0 references
5 September 2014
0 references
de Bruijn cycle
0 references
universal cycle
0 references
necklace
0 references
FKM algorithm
0 references
minimum weight
0 references
0 references
0.8955947756767273
0 references
0.7939481735229492
0 references
0.7891203761100769
0 references
0.7549959421157837
0 references
0.7408812642097473
0 references
