Autorenfreundlich Bücher kaufen?!
Beschreibung
It is shown an incorrectness of introduction of a class of NP-complete problems, which reason is that Cook¿s 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.
Details
| Verlag | LAP LAMBERT Academic Publishing |
| Ersterscheinung | 03. Juli 2014 |
| Maße | 22 cm x 15 cm x 0.8 cm |
| Gewicht | 179 Gramm |
| Format | Softcover |
| ISBN-13 | 9783659549052 |
| Seiten | 108 |
Schlagwörter
Bekannt durch
