An explicit universal cycle for the \((n-1)\)-permutations of an \(n\)-set (Q6486946)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6370656
- An explicit universal cycle for the ( <i>n</i> -1)-permutations of an <i>n</i> -set
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An explicit universal cycle for the \((n-1)\)-permutations of an \(n\)-set |
scientific article; zbMATH DE number 6370656 |
|
Statements
An explicit universal cycle for the \((n-1)\)-permutations of an \(n\)-set (English)
0 references
An explicit universal cycle for the ( <i>n</i> -1)-permutations of an <i>n</i> -set (English)
0 references
18 November 2014
0 references
universal cycle
0 references
loopless algorithm
0 references
0.9284703
0 references
0.91972196
0 references
0 references
0.9106843
0 references
0 references
0.89887244
0 references
0.8910608
0 references
0.8891527
0 references
