Standard

On the complexity of binary floating point pseudorandom generation. / Nekrutkin, Vladimir.

в: Monte Carlo Methods and Applications, Том 22, № 2, 2016, стр. 109 -- 116.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Nekrutkin, V 2016, 'On the complexity of binary floating point pseudorandom generation', Monte Carlo Methods and Applications, Том. 22, № 2, стр. 109 -- 116.

APA

Nekrutkin, V. (2016). On the complexity of binary floating point pseudorandom generation. Monte Carlo Methods and Applications, 22(2), 109 -- 116.

Vancouver

Nekrutkin V. On the complexity of binary floating point pseudorandom generation. Monte Carlo Methods and Applications. 2016;22(2):109 -- 116.

Author

Nekrutkin, Vladimir. / On the complexity of binary floating point pseudorandom generation. в: Monte Carlo Methods and Applications. 2016 ; Том 22, № 2. стр. 109 -- 116.

BibTeX

@article{03fcc261bca449e8848f0ef82d7b172a,
title = "On the complexity of binary floating point pseudorandom generation",
author = "Vladimir Nekrutkin",
year = "2016",
language = "English",
volume = "22",
pages = "109 ---- 116",
journal = "Monte Carlo Methods and Applications",
issn = "0929-9629",
publisher = "De Gruyter",
number = "2",

}

RIS

TY - JOUR

T1 - On the complexity of binary floating point pseudorandom generation

AU - Nekrutkin, Vladimir

PY - 2016

Y1 - 2016

M3 - Article

VL - 22

SP - 109

EP - 116

JO - Monte Carlo Methods and Applications

JF - Monte Carlo Methods and Applications

SN - 0929-9629

IS - 2

ER -

ID: 7569835