Applying fast simulation to find the number of good permutations

DOI10.1007/s10559-007-0107-xzbMath1142.90475OpenAlexW1989368370MaRDI QIDQ941195

N. Yu. Kuznetsov

Publication date: 4 September 2008

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-007-0107-x

zbMATH Keywords

permutationsample variancerelative errorunbiased estimatefast simulation method

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial optimization (90C27) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (6)

A congruence connecting Latin rectangles and partial orthomorphisms ⋮ Additive triples of bijections, or the toroidal semiqueens problem ⋮ Works of the Kiev school of theoretical cryptography ⋮ On the number of transversals in Cayley tables of cyclic groups ⋮ Compound orthomorphisms of the cyclic group ⋮ Estimating the number of good permutations by a modified fast simulation method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using stratified sampling to solve the Knapsack problem
• Upper bound on the number of complete maps
• Computing the permanent by importance sampling method.
• Estimation of the number of ``good permutations with applications to cryptography

This page was built for publication: Applying fast simulation to find the number of good permutations