Applying fast simulation to find the number of good permutations
type: Item
instance of: scholarly article
title: Applying fast simulation to find the number of good permutations
zbMATH Open document ID: 1142.90475
author: N. Yu. Kuznetsov
published in: Cybernetics and Systems Analysis
publication date: 2008-09-04T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 05-04
zbMATH DE Number: 5320956
zbMATH Keywords: permutation
zbMATH Keywords: fast simulation method
zbMATH Keywords: unbiased estimate
zbMATH Keywords: sample variance
zbMATH Keywords: relative error
MaRDI profile type: Publication
full work available at URL: s10559-007-0107-x
OpenAlex ID: W1989368370
cites work: Q3765777
cites work: Estimation of the number of ``good'' permutations with applications to cryptography
cites work: Q3705340
cites work: Q4940372
cites work: Upper bound on the number of complete maps
cites work: Computing the permanent by importance sampling method.
cites work: Using stratified sampling to solve the Knapsack problem
DOI: 10.1007/S10559-007-0107-X
Recommended article: Estimating the number of good permutations by a modified fast simulation method
Recommended article: Using the Monte Carlo method for fast simulation of the number of ``good'' permutations on the SCIT-4 multiprocessor computer complex
Recommended article: Q4036581
Recommended article: On the Intriguing Search for Good Permutations
Recommended article: Q3077344
Recommended article: Efficient methods of calculating the number of heapable permutations
Recommended article: Applications of permutations to the simulations of critical values
Recommended article: Fast generation of random permutations via networks simulation
Recommended article: A fast algorithm for multiplying min-sum permutations
description: scientific article; zbMATH DE number 5320956