Category:Pseudorandomness
 | Computing portal |
Here is a list of articles in the Pseudorandomness category of the Computing portal that unifies foundations of mathematics and computations using computers.
Pseusorandomness is a term applied to the simulation of apparent randomness (for example, flipping a coin) by a deterministic process.
Subcategories
This category has only the following subcategory.
P
Pages in category "Pseudorandomness"
The following 16 pages are in this category, out of 16 total.
- Pseudorandomness (computing)
E
- Ehrenfeucht–Mycielski sequence (computing)
- Extractor (mathematics) (computing)
H
- Hard-core predicate (computing)
I
- Russell Impagliazzo (biography)
M
- Maximum length sequence (computing)
P
- PRF advantage (computing)
- Pseudorandom binary sequence (computing)
- Pseudorandom ensemble (computing)
- Pseudorandom function family (computing)
- Pseudorandom generator (computing)
- Pseudorandom generator theorem (computing)
- Pseudorandom generators for polynomials (computing)
- Pseudorandom noise (computing)
S
- Small-bias sample space (computing)
- Stochastic screening (computing)
Mathematics
Organizations
Books
About