On the complexity of binary floating point pseudorandom generation (Q293511): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1515/mcma-2016-0105 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2517016849 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Interval algorithm for random number generation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4178385 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sharp entropy bounds for discrete statistical simulation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A PRNG Specialized in Double Precision Floating Point Numbers Using an Affine Transition / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:39, 12 July 2024
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
pseudorandom generators
0 references
binary floating point numbers
0 references
complexity of simulation
0 references
