Conte aos seus amigos sobre este item:
On the Class of Np-complete Problems and Rank Approach
Sergey Listrovoy
Item sob encomenda (no estoque do fornecedor)
O que dizem nossos clientes:
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.
| Mídia | Livros Paperback Book (Livro de capa flexível e brochura) |
| Lançado | 3 de julho de 2014 |
| ISBN13 | 9783659549052 |
| Editoras | LAP LAMBERT Academic Publishing |
| Páginas | 108 |
| Dimensões | 152 × 229 × 7 mm · 179 g |
| Idioma | German |
Ver tudo de Sergey Listrovoy ( por exemplo Paperback Book )