Testing of sequences by simulation

MaRDI QIDQ3000071zbMATH OpenFDO

Authors Antal Iványi, Balázs Novák

Publication date 18 May 2011

Full work available at URL https://arxiv.org/abs/1012.0032

zbMATH Keywords

analysis of algorithmsLatin squaresrandom sequencessudoku squares

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

• Quick testing of random sequences
• Testing of random matrices
• Sorting and goodness-of-fit tests of uniformity in random number generation
• Using the Monte Carlo method for fast simulation of the number of ``good permutations on the SCIT-4 multiprocessor computer complex
• Observations on the generation of permutations from random sequences

Cited in

(4)

• Nonlinear sequences for annular testing of discrete devices
• Quick testing of random sequences
• Testing of random matrices
• scientific article; zbMATH DE number 1969617 (Why is no real title available?)

This page was built for publication: Testing of sequences by simulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000071)