In some curved spaces, one can solve NP-hard problems in polynomial time

In some curved spaces, one can solve NP-hard problems in polynomial time

In the late 1970s and 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 space...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of mathematical sciences (New York, N.Y.) N.Y.), 2009-05, Vol.158 (5), p.727-740
Hauptverfasser: Kreinovich, V., Margenstern, M.
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics
Mathematics and Statistics
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In the late 1970s and 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. Bibliography: 50 titles.
ISSN:1072-3374
1573-8795
DOI:10.1007/s10958-009-9402-6