Review: V. N. Agafonov, Complexity of Computing Pseudorandom Sequences
Loveland, D. W.
J. Symbolic Logic, Tome 40 (1975) no. 1, p. 248-249 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 1975-06-14
Classification:  
@article{1183739408,
     author = {Loveland, D. W.},
     title = {Review: V. N. Agafonov, Complexity of Computing Pseudorandom Sequences},
     journal = {J. Symbolic Logic},
     volume = {40},
     number = {1},
     year = {1975},
     pages = { 248-249},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183739408}
}

Loveland, D. W. Review: V. N. Agafonov, Complexity of Computing Pseudorandom Sequences. J. Symbolic Logic, Tome 40 (1975) no. 1, pp.  248-249. http://gdmltest.u-ga.fr/item/1183739408/