Pastāsti draugiem par šo preci:
On the Class of Np-complete Problems and Rank Approach Sergey Listrovoy
Pasūtīts no attālās noliktavas
Mūsu klienti saka:
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.
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2014. gada 3. jūlijs |
| ISBN13 | 9783659549052 |
| Izdevēji | LAP LAMBERT Academic Publishing |
| Lapas | 108 |
| Izmēri | 152 × 229 × 7 mm · 179 g |
| Valoda | Vācu |
Skatīt visus Sergey Listrovoy ( piem., Paperback Book )