Estimating the number of good permutations by a modified fast simulation method

Cybernetics and Systems Analysis

Volumn 44, Issue 4, 2008, Pages 547-554

  Kuznetsov, N Yu ^a  

^a V M GLUSHKOV INSTITUTE OF CYBERNETICS   (Ukraine)

Author keywords

Good permutation; Modified fast simulation method; Relative error; Sample variance; Unbiased estimate

Indexed keywords

GOOD PERMUTATION; MODIFIED FAST SIMULATION METHOD; RELATIVE ERROR; SAMPLE VARIANCE; UNBIASED ESTIMATE;

SYSTEMS ENGINEERING;

EID: 51049111823     PISSN: 10600396     EISSN: 15738337     Source Type: Journal    
DOI: 10.1007/s10559-008-9025-9     Document Type: Article

References (12)

1. V. N. Sachkov, Introduction to Combinatorial Methods of Discrete Mathematics [in Russian], Nauka, Moscow (1982).
2. V. N. Sachkov, "Markov chains of iterative conversion systems," Tr. Diskret. Matem., 6, 165-183 (2002).
3. J. Hsiang, D. F. Hsu, and Y.-P. Shieh, "On the hardness of counting problems of complete mappings," Discrete Math., 277, 87-100 (2004).
4. D. F. Hsu and A. D. Keedwell, "Generalized complete mappings, neofields, sequenceable groups and block designs. II," Pacific J. Math., 117, 291-312 (1985).
5. 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).
6. R. Konheim, Cryptography: A Primer, Wiley, Chichester (1991).
7. Y.-P. Shieh, "Partition strategies for #P-complete problem with applications to enumerative combinatorics," Ph.D. Thesis, Nat. Taiwan Univ. (2001).
8. http://www.research.att.com/~njas/sequences/A003111.
9. C. Cooper and I. N. Kovalenko, "An upper bound for the number of complete mappings," Teor. Veroyatn. Mat. Statistika, 53, 69-75 (1995).
10. I. N. Kovalenko, "Upper bound on the number of complete maps," Cybern. Syst. Analysis, 32, No. 1, 65-68 (1996).
11. n of residues odd modulo n," Probl. Upravl. Inform., No. 5, 99-108 (1996).
12. N. Yu. Kuznetsov, "Applying fast simulation to find the number of good permutations," Cybern. Syst. Analysis, 43, No. 6, 830-837 (2007).