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

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10559-007-0107-x / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q3765777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of the number of ``good'' permutations with applications to cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3705340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bound on the number of complete maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the permanent by importance sampling method. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using stratified sampling to solve the Knapsack problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10559-007-0107-X / rank
 
Normal rank

Latest revision as of 09:58, 10 December 2024

scientific article
Language Label Description Also known as
English
Applying fast simulation to find the number of good permutations
scientific article

    Statements

    Applying fast simulation to find the number of good permutations (English)
    0 references
    0 references
    4 September 2008
    0 references
    permutation
    0 references
    fast simulation method
    0 references
    unbiased estimate
    0 references
    sample variance
    0 references
    relative error
    0 references

    Identifiers