In Some Curved Spaces, One Can Solve NP-Hard Problems in Polynomial Time

Authors

Vladik Kreinovich, The University of Texas at El PasoFollow
Maurice Margenstern

Publication Date

9-2007

Comments

Technical Report: UTEP-CS-07-30a

Published in Notes of Mathematical Seminars of St. Petersburg Department of Steklov Institute of Mathematics, 2008, Vol. 358, pp. 224-250; reprinted in Journal of Mathematical Sciences, 2009, Vol. 158, No. 5, pp. 727-740.

Abstract

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.