|
Complexity of computation of pseudorandom sequences
V. N. Agafonov
Received: 22.12.1967
Citation:
V. N. Agafonov, “Complexity of computation of pseudorandom sequences”, Algebra Logika, 7:2 (1968), 4–19
Linking options:
https://www.mathnet.ru/eng/al1144 https://www.mathnet.ru/eng/al/v7/i2/p4
|
Statistics & downloads: |
Abstract page: | 50 | Full-text PDF : | 24 |
|