On the complexity of binary floating point pseudorandom generation (Q293511): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65C10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q87 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68U20 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6590824 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
pseudorandom generators | |||
Property / zbMATH Keywords: pseudorandom generators / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
binary floating point numbers | |||
Property / zbMATH Keywords: binary floating point numbers / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
complexity of simulation | |||
Property / zbMATH Keywords: complexity of simulation / rank | |||
Normal rank |
Revision as of 20:19, 27 June 2023
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