Necessary and sufficient conditions for dividing the structure of algorithms into non-intersecting sets: polynomial and enumeration algorithms
The article is devoted to a rigorous proof of the first millennium problem, which is named as P≠NP. This problem was raised in 1971 by S. Cook and marked the beginning of a long struggle in order to understand and prove it. The problem is closely related to the concept of a combinatorial explosion,...
Uložené v:
| Vydané v: | Vestnik Rossiĭskogo universiteta druzhby narodov. Serii͡a︡ Inzhenernye issledovanii͡a Ročník 23; číslo 2; s. 108 - 116 |
|---|---|
| Hlavný autor: | |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Peoples’ Friendship University of Russia (RUDN University)
21.08.2022
|
| ISSN: | 2312-8143, 2312-8151 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
Buďte prvý, kto okomentuje tento záznam!