Estimating the number of good permutations by a modified fast simulation method
type: Item
instance of: scholarly article
title: Estimating the number of good permutations by a modified fast simulation method
zbMATH Open document ID: 1157.05304
author: N. Yu. Kuznetsov
published in: Cybernetics and Systems Analysis
publication date: 2009-03-27T00:00:00Z
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05A15
zbMATH DE Number: 5534471
zbMATH Keywords: good permutation
zbMATH Keywords: modified 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-008-9025-9
OpenAlex ID: W1964710753
cites work: Q3765777
cites work: On the hardness of counting problems of complete mappings.
cites work: Generalized complete mappings, neofields, sequenceable groups and block designs. II
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: Applying fast simulation to find the number of good permutations
DOI: 10.1007/S10559-008-9025-9
description: scientific article; zbMATH DE number 5534471