Randomization function: Difference between revisions

Revision as of 14:51, 22 February 2011

Revision as of 17:08, 16 March 2011

Line 1:

{{unreferencedUnreferenced|date=April 2009}}

In [[computer science]], a '''randomization function''' or '''randomizing function''' is an [[algorithm]] or [[Subroutine|procedure]] that implements a [[random]]ly chosen [[function (mathematics)|function]] between two specific [[set (mathematics)|set]]s, suitable for use in a [[randomized algorithm]].

Randomizing functions are related to [[random number generator]]s and [[hash function]]s, but have somewhat different requirements and uses, and often need specific algorithms.

Line 20 ⟶ 21:

==References==

{{unreferenced|date=April 2009}}

{{comp-sci-stub}}

[[Category:Algorithms]]