Upper bound on the number of complete maps
From MaRDI portal
Publication:1364111
DOI10.1007/BF02366583zbMath0877.05003MaRDI QIDQ1364111
Publication date: 8 December 1997
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02366583
Related Items
On the maximum number of Latin transversals, The number of transversals in a Latin square, Applying fast simulation to find the number of good permutations, On the number of transversals in Cayley tables of cyclic groups, Compound orthomorphisms of the cyclic group, A survey of known results and research areas for \(n\)-queens, Estimating the number of good permutations by a modified fast simulation method, Estimating the number of Latin rectangles by the fast simulation method, Calculation of the number of complete mappings for permutations, A review of my scientific publications. Masters and coworkers, Works of the Kiev school of theoretical cryptography