Review: J. Hartmanis, R. E. Stearns, On the Computational Complexity of Algorithms
Becvar, Jiri
J. Symbolic Logic, Tome 32 (1967) no. 1, p. 120-121 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 1967-03-14
Classification:  
@article{1183735762,
     author = {Becvar, Jiri},
     title = {Review: J. Hartmanis, R. E. Stearns, On the Computational Complexity of Algorithms},
     journal = {J. Symbolic Logic},
     volume = {32},
     number = {1},
     year = {1967},
     pages = { 120-121},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183735762}
}

Becvar, Jiri. Review: J. Hartmanis, R. E. Stearns, On the Computational Complexity of Algorithms. J. Symbolic Logic, Tome 32 (1967) no. 1, pp.  120-121. http://gdmltest.u-ga.fr/item/1183735762/