Hostname: page-component-6bf8c574d5-w79xw Total loading time: 0 Render date: 2025-02-22T01:12:00.789Z Has data issue: false hasContentIssue false
  • English
  • Français

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.

Review products

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

D. W. Loveland
Get access Rights & Permissions [Opens in a new window]

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.'
Type
Reviews
Information
The Journal of Symbolic Logic , Volume 40 , Issue 2 , June 1975 , pp. 248 - 249
Copyright
Copyright © Association for Symbolic Logic 1975

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)