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 this page instead for the normal view: On the complexity of binary floating point pseudorandom generation |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the complexity of binary floating point pseudorandom generation |
scientific article |
Statements
On the complexity of binary floating point pseudorandom generation (English)
0 references
9 June 2016
0 references