Review: G. S. Matveeva, On a Theorem of Rabin Concerning the Complexity of Computable Functions
Becvar, Jiri
J. Symbolic Logic, Tome 34 (1969) no. 1, p. 133-134 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 1969-03-14
Classification:  
@article{1183736671,
     author = {Becvar, Jiri},
     title = {Review: G. S. Matveeva, On a Theorem of Rabin Concerning the Complexity of Computable Functions},
     journal = {J. Symbolic Logic},
     volume = {34},
     number = {1},
     year = {1969},
     pages = { 133-134},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183736671}
}

Becvar, Jiri. Review: G. S. Matveeva, On a Theorem of Rabin Concerning the Complexity of Computable Functions. J. Symbolic Logic, Tome 34 (1969) no. 1, pp.  133-134. http://gdmltest.u-ga.fr/item/1183736671/