On the complexity of binary floating point pseudorandom generation (Q293511): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1515/mcma-2016-0105 / 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 | |||
| Property / DOI | |||
| Property / DOI: 10.1515/MCMA-2016-0105 / rank | |||
Normal rank | |||
Latest revision as of 13:37, 9 December 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
