Tell your friends about this item:
On the Class of Np-complete Problems and Rank Approach Sergey Listrovoy
Ordered from remote warehouse
Our customers say:
On the Class of Np-complete Problems and Rank Approach
Sergey Listrovoy
It is shown an incorrectness of introduction of a class of NP-complete problems, which reason is that Cook?s S. A. 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.
| Media | Books Paperback Book (Book with soft cover and glued back) |
| Released | July 3, 2014 |
| ISBN13 | 9783659549052 |
| Publishers | LAP LAMBERT Academic Publishing |
| Pages | 108 |
| Dimensions | 152 × 229 × 7 mm · 179 g |
| Language | German |
See all of Sergey Listrovoy ( e.g. Paperback Book )