Applying fast simulation to find the number of good permutations

Cybernetics and Systems Analysis

Volumn 43, Issue 6, 2007, Pages 830-837

  Kuznetsov, N Yu ^a  

^a V M GLUSHKOV INSTITUTE OF CYBERNETICS   (Ukraine)

Author keywords

Fast simulation method; Permutation; Relative error; Sample variance; Unbiased estimate

Indexed keywords

PERMUTATIONS; RELATIVE ERROR; SAMPLE VARIANCE; UNBIASED ESTIMATE;

COMPUTER SIMULATION; NUMERICAL METHODS; OPTIMIZATION; SET THEORY;

SYSTEMS ANALYSIS;

EID: 37349025756     PISSN: 10600396     EISSN: 15738337     Source Type: Journal    
DOI: 10.1007/s10559-007-0107-x     Document Type: Article

References (9)

1. V. N. Sachkov, Introduction to Combinatorial Methods of Discrete Mathematics [in Russian], Nauka, Moscow (1982).
2. V. N. Sachkov, "Markov chains of iterative systems of transforms," Tr. Discret. Mat., 6, 165-183 (2002).
3. C. Cooper, R. Gilchrist, I. N. Kovalenko, and D. Novakovic, "Estimation of the number of "good" permutations, with application to cryptography," Cybern. Syst. Analysis, 35, No. 5, 688-693 (1999).
4. R. Konheim, Cryptography: A Primer, Wiley, Chichester (1991).
5. C. Cooper and I. N. Kovalenko, "An upper bound for the number of complete mappings," Probability Theory and Math. Statistics, 53, 69-75 (1995).
6. I. N. Kovalenko, "Upper bound on the number of complete maps," Cybern. Syst. Analysis, 32, No. 1, 65-68 (1996).
7. A. A. Levitskaya, "A combinatorial problem in a class of permutations over a ring Z n of odd modulo n residues," J. Autom. Inform. Sci., 28, No. 5, 99-108 (1996).
8. N. Yu. Kuznetsov, "Computing the permanent by importance sampling method," Cybern. Syst. Analysis, 32, No. 6, 749-755 (1996).
9. N. Yu. Kuznetsov, "Using stratified sampling to solve the knapsack problem," Cybern. Syst. Analysis, 34, No. 1, 61-68 (1998).