- shuffle permutation
- мат. тасующая подстановка
Большой англо-русский и русско-английский словарь. 2001.
shuffle permutation
Смотреть что такое "shuffle permutation" в других словарях:
Permutation — For other uses, see Permutation (disambiguation). The 6 permutations of 3 balls In mathematics, the notion of permutation is used with several slightly different meanings, all related to the act of permuting (rearranging) objects or values.… … Wikipedia
Permutation aléatoire — Une permutation aléatoire de taille N est une permutation prise de manière uniforme dans l ensemble des permutations de taille N. Par exemple pour N=5, nous pouvons obtenir (15423) ou encore (34125). Les permutations aléatoires peuvent être mises … Wikipédia en Français
Faro shuffle — The faro shuffle is a method of shuffling playing cards.In a perfect shuffle or perfect faro shuffle, the deck is split into equal halves of 26 cards which are then pushed together in a certain way so as to make them perfectly interweave. The… … Wikipedia
Fisher-Yates shuffle — The Fisher Yates shuffle, named after Ronald Fisher and Frank Yates, also known as the Knuth shuffle, after Donald Knuth, is an algorithm for generating a random permutation of a finite set in plain terms, for randomly shuffling the set. A… … Wikipedia
Random permutation — A random permutation is a random ordering of a set of objects, that is, a permutation valued random variable. The use of random permutations is often fundamental to fields that use randomized algorithms. Such fields include coding theory,… … Wikipedia
List of permutation topics — This is a list of topics on mathematical permutations.*Alternating group *Alternating permutation *Bijection *Circular shift *Combination *Cycle index *Cycle notation *Cyclic order *Cyclic permutation *Derangement *Even and odd permutations… … Wikipedia
(p,q) shuffle — Let p and q be positive natural numbers. Further, let S(k) be the set of permutations of the numbers {1,ldots, k}. A permutation au in S(p+q) is a (p,q)shuffle if: au(1) < cdots < au(p) ,, : au(p+1) < cdots < au(p+q) ,. The set of all (p,q)… … Wikipedia
Verbindungsnetzwerk — Ein Verbindungsnetzwerk beschreibt eine technische Einrichtung, die die Aufgabe hat, eine statische oder dynamische Verbindung zwischen einem Sender und einem Empfänger über ein entsprechendes Leitungsmedium herzustellen, um eine… … Deutsch Wikipedia
Shuffling — Shuffle redirects here. For other uses, see Shuffle (disambiguation). Shuffling is a procedure used to randomize a deck of playing cards to provide an element of chance in card games. Shuffling is often followed by a cut, to help ensure that the… … Wikipedia
Format-preserving encryption — In cryptography, format preserving encryption (FPE) refers to encrypting in such a way that the output (the ciphertext) is in the same format as the input (the plaintext). The meaning of format varies. Typically only finite domains are discussed … Wikipedia
Symmetric group — Not to be confused with Symmetry group. A Cayley graph of the symmetric group S4 … Wikipedia
