Applying fast simulation to find the number of good permutations (Q941195): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10559-007-0107-x
+Normal rank
@@ Property / OpenAlex ID @@
+W1989368370
@@ Property / OpenAlex ID: W1989368370 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3765777
@@ Property / cites work: Q3765777 / rank @@
+Normal rank
@@ Property / cites work @@
+Estimation of the number of ``good'' permutations with applications to cryptography
+Normal rank
@@ Property / cites work @@
+Q3705340
@@ Property / cites work: Q3705340 / 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 @@
+Computing the permanent by importance sampling method.
+Normal rank
@@ Property / cites work @@
+Using stratified sampling to solve the Knapsack problem
+Normal rank