No CrossRef data available.
Article contents
V. N. Agafonov. Složnost' vyčisléniá psévdoslučajnyh poslédovatél'nostéj. Algébra i logika, vol. 7 no. 2 (1968), pp. 4–19. - V. N. Agafonov. Complexity of computing pseudorandom sequences. English translation of the preceding. Algebra and logic (New York), vol. 7 (1968), pp. 72–81.
Published online by Cambridge University Press: 12 March 2014
Abstract
An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Aarticle%3AS0022481200054025/resource/name/firstPage-S0022481200054025a.jpg)
- Type
- Reviews
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1975