Wikipedia:Articles for deletion/Randomization function
[Hide this box] New to Articles for deletion (AfD)? Read these primers!
- Randomization function (edit | talk | history | protect | delete | links | watch | logs | views) – (View log | edits since nomination)
- (Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL)
- Article on an ill-defined concept, that lacks references. Reasons for deletion:
- Article has no references and has been marked as Unreferenced since 2009. I was not able to find any references for this concept. It seems that the term 'randomization function' is not used systematically in literature.
- The article does not clarify what a 'Randomized function' actually is. If fails to explain how the concept is different from a hash function, a pseudorandom function family or a random permutation The articles states that while 'Randomization functions' are related to hash functions, their uses and requirements are different, but it does not elaborate on this.
- The example about quicksort is actually a nice illustration of the use of randomized algorithms. However, this is explained better at Randomized algorithm and Quicksort
- Only two pages link to this article (Hash function and Checksum). Plusminusone (talk) 20:16, 24 May 2022 (UTC)