On the complexity of binary floating point pseudorandom generation (Q293511)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6590824
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of binary floating point pseudorandom generation |
scientific article; zbMATH DE number 6590824 |
Statements
On the complexity of binary floating point pseudorandom generation (English)
0 references
9 June 2016
0 references
pseudorandom generators
0 references
binary floating point numbers
0 references
complexity of simulation
0 references
0.7530631422996521
0 references
0.7375231385231018
0 references
0.7340197563171387
0 references
0.7213916182518005
0 references
