Beschreibung
It is shown an incorrectness of introduction of a class of NP-complete problems, which reason is that Cooks S. theorem on that the satisfiability problem is the universal NP-complete problem, is not true and, therefore, the issue on existence of at least one NP-complete problem remains open, that explains failures of attempts to estimate correlations between P and NP classes. Developed a universal procedure for solving a wide range of discrete optimization problems, which can be efficiently parallelized based on cyclic structures.
Autorenporträt
Listrovoy Sergey Vladimirovich, doctor of technical sciences, professor of Ukrainian State Academy of Railway Transport, Kharkov. In 1972 has finished high military command engineering school in Kharkov. The Area of the scientific studies of the problem to discrete optimization and graph theory and their use to analysis of the computing systems.
Herstellerkennzeichnung:
OmniScriptum SRL
Str. Armeneasca 28/1, office 1
2012 Chisinau
MD
E-Mail: info@omniscriptum.com
