Pseudorandom generators and the frequency of simplicity (Q2563546)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Pseudorandom generators and the frequency of simplicity |
scientific article; zbMATH DE number 958174
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pseudorandom generators and the frequency of simplicity |
scientific article; zbMATH DE number 958174 |
Statements
Pseudorandom generators and the frequency of simplicity (English)
0 references
26 May 1997
0 references
computational complexity
0 references
Kolmogorov complexity
0 references
pseudorandom generators
0 references
0.9999999
0 references
0.9049483
0 references
0 references
0.89475226
0 references
0.8940231
0 references
0.8903456
0 references
