Pages that link to "Item:Q1008305"
From MaRDI portal
The following pages link to Estimating the number of good permutations by a modified fast simulation method (Q1008305):
Displaying 9 items.
- Using the Monte Carlo method for fast simulation of the number of ``good'' permutations on the SCIT-4 multiprocessor computer complex (Q289789) (← links)
- Applying fast simulation to find the number of good permutations (Q941195) (← links)
- On the number of transversals in Cayley tables of cyclic groups (Q968119) (← links)
- Compound orthomorphisms of the cyclic group (Q982484) (← links)
- Estimating the number of Latin rectangles by the fast simulation method (Q1040349) (← links)
- Estimation of the number of ``good'' permutations with applications to cryptography (Q1580181) (← links)
- Calculation of the number of complete mappings for permutations (Q1592100) (← links)
- Additive triples of bijections, or the toroidal semiqueens problem (Q1725577) (← links)
- A congruence connecting Latin rectangles and partial orthomorphisms (Q1928590) (← links)