Review: Yu. V. Matiyasevich, Desyataya Problema Gil'berta; Christos H. Papadimitriou, Computational Complexity
Immerman, Neil
J. Symbolic Logic, Tome 62 (1997) no. 1, p. 677-678 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 1997-06-14
Classification:  
@article{1183745253,
     author = {Immerman, Neil},
     title = {Review: Yu. V. Matiyasevich, Desyataya Problema Gil'berta; Christos H. Papadimitriou, Computational Complexity},
     journal = {J. Symbolic Logic},
     volume = {62},
     number = {1},
     year = {1997},
     pages = { 677-678},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183745253}
}

Immerman, Neil. Review: Yu. V. Matiyasevich, Desyataya Problema Gil'berta; Christos H. Papadimitriou, Computational Complexity. J. Symbolic Logic, Tome 62 (1997) no. 1, pp.  677-678. http://gdmltest.u-ga.fr/item/1183745253/