An efficient Gray code algorithm for generating all permutations with a given major index (Q2447540)
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: An efficient Gray code algorithm for generating all permutations with a given major index |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient Gray code algorithm for generating all permutations with a given major index |
scientific article |
Statements
An efficient Gray code algorithm for generating all permutations with a given major index (English)
0 references
28 April 2014
0 references
generating algorithms permutations
0 references
(bounded) compositions of an integer
0 references
major index
0 references
0.8152660131454468
0 references
0.812545657157898
0 references
0.7851483821868896
0 references
0.7677951455116272
0 references
