Publisher
Springer Science and Business Media LLC
Reference18 articles.
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 transformations,” Tr. Diskr. 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 Mathematics, 277, 87–100 (2004).
4. 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).
5. D. F. Hsu and A. D. Keedwell, “Generalized complete mappings, neofields, sequenceable groups and block designs. II,” Pacific J. Math., 117, 291–312 (1985).