메뉴 건너뛰기




Volumn 45, Issue 1, 2009, Pages 69-75

Estimating the number of latin rectangles by the fast simulation method

Author keywords

Fast simulation method; Latin rectangle; Latin square; Relative error; Sample variance; Transversal; Unbiased estimate

Indexed keywords

FAST SIMULATION METHOD; LATIN RECTANGLE; LATIN SQUARE; RELATIVE ERROR; SAMPLE VARIANCE; TRANSVERSAL; UNBIASED ESTIMATE;

EID: 62249135166     PISSN: 10600396     EISSN: 15738337     Source Type: Journal    
DOI: 10.1007/s10559-009-9079-3     Document Type: Article
Times cited : (8)

References (12)
  • 1
    • 0037760934 scopus 로고
    • "The complexity of completing partial Latin squares"
    • C. Colbourn, "The complexity of completing partial Latin squares," Discrete Appl. Math., 8, 25-30 (1984).
    • (1984) Discrete Appl. Math. , vol.8 , pp. 25-30
    • Colbourn, C.1
  • 4
    • 84864157559 scopus 로고    scopus 로고
    • http://en.wikipedia.org/wiki/Latin-square.
  • 5
    • 33747622804 scopus 로고    scopus 로고
    • "The number of transversals in a Latin square"
    • B. D. McKay, J.C. McLeod, and I. M. Wanless, "The number of transversals in a Latin square," Des. Codes Crypt., 40, 269-284 (2006).
    • (2006) Des. Codes Crypt. , vol.40 , pp. 269-284
    • McKay, B.D.1    McLeod, J.C.2    Wanless, I.M.3
  • 7
    • 0039145872 scopus 로고
    • "On the asymptotic number of Latin rectangles"
    • K. Yamamoto, "On the asymptotic number of Latin rectangles," Jap. J. Math., 21, 113-119 (1951).
    • (1951) Jap. J. Math. , vol.21 , pp. 113-119
    • Yamamoto, K.1
  • 8
    • 37349029999 scopus 로고
    • "An upper bound for the number of complete mappings"
    • C. Cooper and I. N. Kovalenko, "An upper bound for the number of complete mappings," Teor. Veroyatn. Mat. Statist., 53, 69-75 (1995).
    • (1995) Teor. Veroyatn. Mat. Statist. , vol.53 , pp. 69-75
    • Cooper, C.1    Kovalenko, I.N.2
  • 9
    • 33747010472 scopus 로고    scopus 로고
    • "Upper bound on the number of complete maps"
    • I. N. Kovalenko, "Upper bound on the number of complete maps," Cybern. Syst. Analysis, 32, No. 1, 81-85 (1996).
    • (1996) Cybern. Syst. Analysis , vol.32 , Issue.1 , pp. 81-85
    • Kovalenko, I.N.1
  • 11
    • 33747230487 scopus 로고    scopus 로고
    • "Estimation of the number of " good" permutations with applications to cryptography"
    • C. Cooper, R. Gilchrist, I. N. Kovalenko, and D. Novakovic, "Estimation of the number of " good" permutations with applications to cryptography," Cybern. Syst. Analysis, 35, No. 5, 688-693 (1999).
    • (1999) Cybern. Syst. Analysis , vol.35 , Issue.5 , pp. 688-693
    • Cooper, C.1    Gilchrist, R.2    Kovalenko, I.N.3    Novakovic, D.4
  • 12
    • 51049111823 scopus 로고    scopus 로고
    • "Estimating the number of good permutations by a modified fast simulation method"
    • N. Yu. Kuznetsov, "Estimating the number of good permutations by a modified fast simulation method," Cybern. Syst. Analysis, 44, No. 4, 547-554 (2008).
    • (2008) Cybern. Syst. Analysis , vol.44 , Issue.4 , pp. 547-554
    • Kuznetsov, N.Yu.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.