|
Zapiski Nauchnykh Seminarov POMI, 2008, Volume 358, Pages 224–250
(Mi znsl2153)
|
|
|
|
This article is cited in 5 scientific papers (total in 5 papers)
In some curved spaces, one can solve NP-hard problems in polynomial time
V. Kreinovicha, M. Margensternb a Department of Computer Science, University of Texas at El Paso
b The Paul Verlaine University in Metz
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. Bibl. – 50 titles.
Received: 13.05.2007
Citation:
V. Kreinovich, M. Margenstern, “In some curved spaces, one can solve NP-hard problems in polynomial time”, Studies in constructive mathematics and mathematical logic. Part XI, Zap. Nauchn. Sem. POMI, 358, POMI, St. Petersburg, 2008, 224–250; J. Math. Sci. (N. Y.), 158:5 (2009), 727–740
Linking options:
https://www.mathnet.ru/eng/znsl2153 https://www.mathnet.ru/eng/znsl/v358/p224
|
Statistics & downloads: |
Abstract page: | 260 | Full-text PDF : | 142 | References: | 46 |
|