On a theory of computation and complexity over the real numbers: $NP$- completeness, recursive functions and universal machines
Blum, Lenore ; Shub, Mike ; Smale, Steve
Bull. Amer. Math. Soc. (N.S.), Tome 21 (1989) no. 1, p. 1-46 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 1989-07-14
Classification:  03D15,  68Q15,  65V05 
@article{1183555121,
     author = {Blum, Lenore and Shub, Mike and Smale, Steve},
     title = {On a theory of computation and complexity over the real numbers: $NP$- completeness, recursive functions and universal machines},
     journal = {Bull. Amer. Math. Soc. (N.S.)},
     volume = {21},
     number = {1},
     year = {1989},
     pages = { 1-46},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183555121}
}

Blum, Lenore; Shub, Mike; Smale, Steve. On a theory of computation and complexity over the real numbers: $NP$- completeness, recursive functions and universal machines. Bull. Amer. Math. Soc. (N.S.), Tome 21 (1989) no. 1, pp.  1-46. http://gdmltest.u-ga.fr/item/1183555121/