Geodesic
In some curved spaces, one can solve NP-hard problems in polynomial time
Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part XI, Tome 358 (2008), pp. 224-250

Voir la notice de l'article provenant de la source Math-Net.Ru

In the late 1970s and the early 1980s, Yuri Matiyasevich actively used his knowledge of engineering and physical phenomena to come up with parallelized schemes for solving NP-hard problems in polynomial time. In this paper, we describe one such scheme in which we use parallel computation in curved spaces. Bibl. – 50 titles. 
@article{ZNSL_2008_358_a11,
     author = {V. Kreinovich and M. Margenstern},
     title = {In some curved spaces, one can solve {NP-hard} problems in polynomial time},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {224--250},
     publisher = {mathdoc},
     volume = {358},
     year = {2008},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2008_358_a11/}
}
TY  - JOUR
AU  - V. Kreinovich
AU  - M. Margenstern
TI  - In some curved spaces, one can solve NP-hard problems in polynomial time
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 2008
SP  - 224
EP  - 250
VL  - 358
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZNSL_2008_358_a11/
LA  - en
ID  - ZNSL_2008_358_a11
ER  - 
%0 Journal Article
%A V. Kreinovich
%A M. Margenstern
%T In some curved spaces, one can solve NP-hard problems in polynomial time
%J Zapiski Nauchnykh Seminarov POMI
%D 2008
%P 224-250
%V 358
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZNSL_2008_358_a11/
%G en
%F ZNSL_2008_358_a11
V. Kreinovich; M. Margenstern. In some curved spaces, one can solve NP-hard problems in polynomial time. Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part XI, Tome 358 (2008), pp. 224-250. http://geodesic.mathdoc.fr/item/ZNSL_2008_358_a11/