Statistical estimates of the<tex>n</tex>-bit Gray codes by restricted random generation of permutations of 1 to<tex>2^n</tex> (Q3315436)
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: Statistical estimates of the<tex>n</tex>-bit Gray codes by restricted random generation of permutations of 1 to<tex>2ⁿ</tex> |
scientific article; zbMATH DE number 3845496
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Statistical estimates of the&lt;tex&gt;n&lt;/tex&gt;-bit Gray codes by restricted random generation of permutations of 1 to&lt;tex&gt;2^n&lt;/tex&gt; |
scientific article; zbMATH DE number 3845496 |
Statements
Statistical estimates of the&lt;tex&gt;n&lt;/tex&gt;-bit Gray codes by restricted random generation of permutations of 1 to&lt;tex&gt;2^n&lt;/tex&gt; (English)
0 references
1983
0 references
number of n-bit Gray codes
0 references
random permutations
0 references
number of Hamiltonian circuits on the n-cube
0 references
cyclic Gray codes
0 references
statistical estimates
0 references
Monte Carlo process
0 references
0.780731737613678
0 references
0.7804939150810242
0 references
0.7760248184204102
0 references
0.7688432335853577
0 references
