Features of formation and ordering of samples

DOI10.1023/B:CASA.0000042004.85948.6BMaRDI QIDQ1780282zbMATH OpenOpenAlexFDO

Authors N. K. Timofeeva

Publication date 7 June 2005

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:casa.0000042004.85948.6b

zbMATH Keywords

binary sequencespermutation

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Recommendations

• scientific article; zbMATH DE number 3864523
• scientific article; zbMATH DE number 3843149
• scientific article; zbMATH DE number 4195954
• scientific article; zbMATH DE number 3557795
• The art of computer programming. Vol. 4, Fasc. 0--4. Fasc. 0: Introduction to combinatorial algorithms and Boolean functions. Fasc. 1: Bitwise tricks \& techniques, binary decision diagrams. Fasc. 2: Generating all tuples and permutations. Fasc. 3: Genera

Cited in

(3)

• Description and generation of permutations containing cycles
• A problem of packing of homothetic convex polytopes
• Incorporating priorities for waiting customers in the hypercube queuing model with application to an emergency medical service system in Brazil

This page was built for publication: Features of formation and ordering of samples

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