Estimating the number of Latin rectangles by the fast simulation method (Q1040349): Difference between revisions

@@ Property / DOI @@
-.1007/s10559-009-9079-3
@@ Property / DOI: 10.1007/s10559-009-9079-3 / rank @@
-Normal rank
@@ Property / cites work @@
+The complexity of completing partial Latin squares
+Normal rank
@@ Property / cites work @@
+Q4726255
@@ Property / cites work: Q4726255 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3765777
@@ Property / cites work: Q3765777 / rank @@
+Normal rank
@@ Property / cites work @@
+The number of transversals in a Latin square
@@ Property / cites work: The number of transversals in a Latin square / rank @@
+Normal rank
@@ Property / cites work @@
+Q4112750
@@ Property / cites work: Q4112750 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5809957
@@ Property / cites work: Q5809957 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4940372
@@ Property / cites work: Q4940372 / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bound on the number of complete maps
@@ Property / cites work: Upper bound on the number of complete maps / rank @@
+Normal rank
@@ Property / cites work @@
+Estimation of the number of ``good'' permutations with applications to cryptography
+Normal rank
@@ Property / cites work @@
+Estimating the number of good permutations by a modified fast simulation method
+Normal rank
@@ Property / DOI @@
+.1007/S10559-009-9079-3
@@ Property / DOI: 10.1007/S10559-009-9079-3 / rank @@
+Normal rank