Algebra i logika, Tome 7 (1968) no. 2, pp. 4-19
Citer cet article
V. N. Agafonov. Complexity of computation of pseudorandom sequences. Algebra i logika, Tome 7 (1968) no. 2, pp. 4-19. http://geodesic.mathdoc.fr/item/AL_1968_7_2_a0/
@article{AL_1968_7_2_a0,
author = {V. N. Agafonov},
title = {Complexity of computation of pseudorandom sequences},
journal = {Algebra i logika},
pages = {4--19},
year = {1968},
volume = {7},
number = {2},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/AL_1968_7_2_a0/}
}
TY - JOUR
AU - V. N. Agafonov
TI - Complexity of computation of pseudorandom sequences
JO - Algebra i logika
PY - 1968
SP - 4
EP - 19
VL - 7
IS - 2
UR - http://geodesic.mathdoc.fr/item/AL_1968_7_2_a0/
LA - ru
ID - AL_1968_7_2_a0
ER -
%0 Journal Article
%A V. N. Agafonov
%T Complexity of computation of pseudorandom sequences
%J Algebra i logika
%D 1968
%P 4-19
%V 7
%N 2
%U http://geodesic.mathdoc.fr/item/AL_1968_7_2_a0/
%G ru
%F AL_1968_7_2_a0
