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,...
Saved in:
| Published in: | Vestnik Rossiĭskogo universiteta druzhby narodov. Serii͡a︡ Inzhenernye issledovanii͡a Vol. 23; no. 2; pp. 108 - 116 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Peoples’ Friendship University of Russia (RUDN University)
21.08.2022
|
| ISSN: | 2312-8143, 2312-8151 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!