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,...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Vestnik Rossiĭskogo universiteta druzhby narodov. Serii͡a︡ Inzhenernye issledovanii͡a Jg. 23; H. 2; S. 108 - 116
1. Verfasser:	Malinina, Natalia L.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Peoples’ Friendship University of Russia (RUDN University) 21.08.2022
ISSN:	2312-8143, 2312-8151
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!