An explicit universal cycle for the ( <i>n</i> -1)-permutations of an <i>n</i> -set (Q2930325): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q60692573, #quickstatements; #temporary_batch_1704809102140 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:14, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An explicit universal cycle for the ( <i>n</i> -1)-permutations of an <i>n</i> -set |
scientific article |
Statements
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
