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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Vestnik Rossiĭskogo universiteta druzhby narodov. Serii͡a︡ Inzhenernye issledovanii͡a Ročník 23; číslo 2; s. 108 - 116
Hlavní autor: Malinina, Natalia L.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Peoples’ Friendship University of Russia (RUDN University) 21.08.2022
ISSN:2312-8143, 2312-8151
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract 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, which concept was aroused in the early 1970s and became a symbol of the enormous difficulties that developers of algorithms and programs have to face, since the complexity of the tasks that have to be solved is growing every day. The presented proof is based on the achievements of graph theory and algorithm theory. Necessary conditions (normalizing), to which arbitrary algorithm must satisfy in order to be solved with a help of a Turing machine, are proved in the article. Further, using the theory of algorithms and graph theory, it is proved that normalized (necessary condition) graphs (visualization of algorithms) with respect to such a characteristic of their complexity as a cyclomatic number fall into three non-intersecting sets that have different properties. These properties are determined by the structural features of graphs, and they can be taken into account when developing algorithms and programs for solving mass problems. The division of algorithms of mass problems into three non-intersecting sets is proved. Such division corresponds with graph-schemes, or block-schemes of polynomial (P) or enumeration (NP) algorithms. This proves a sufficient condition, to which algorithms must satisfy in order to belong to different classes and actually confirm that P≠NP.
AbstractList 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, which concept was aroused in the early 1970s and became a symbol of the enormous difficulties that developers of algorithms and programs have to face, since the complexity of the tasks that have to be solved is growing every day. The presented proof is based on the achievements of graph theory and algorithm theory. Necessary conditions (normalizing), to which arbitrary algorithm must satisfy in order to be solved with a help of a Turing machine, are proved in the article. Further, using the theory of algorithms and graph theory, it is proved that normalized (necessary condition) graphs (visualization of algorithms) with respect to such a characteristic of their complexity as a cyclomatic number fall into three non-intersecting sets that have different properties. These properties are determined by the structural features of graphs, and they can be taken into account when developing algorithms and programs for solving mass problems. The division of algorithms of mass problems into three non-intersecting sets is proved. Such division corresponds with graph-schemes, or block-schemes of polynomial (P) or enumeration (NP) algorithms. This proves a sufficient condition, to which algorithms must satisfy in order to belong to different classes and actually confirm that P≠NP.
Author Malinina, Natalia L.
Author_xml – sequence: 1
  givenname: Natalia L.
  orcidid: 0000-0003-0116-5889
  surname: Malinina
  fullname: Malinina, Natalia L.
  organization: Moscow Aviation Institute (National Research University)
BookMark eNpNkc1uWyEQhVGVSnXTvAOLbGn5M-ZG3VRWm0SKkk2yRlwYbKxrsABXykv0mct1rCirc2DENzOcr-gi5QQIXTP6nXOhxA8uGCeaSUE45ZzwroRRTRhTn9DiXF2yi3cvxRd0VeuOUsoHJrss0L9HcFCrLa_YJo_rMYToIqSGXU4-tphTxSEX7OPf6GPa4LYFXFs5unYsgHPAdtrkEtt2X3FMLeM-J-kGSgXX5hcVWr3Bhzy9pryPdjp1gnTcQ7Fzgw-Eb-hzsFOFq7Neopc_v5_Xd-Th6fZ-_euBOLYSijAvFGgVJLUDeBUG5tVqdFy7sOwrjzqA4n3DoCU4KVccgAFn3Y-ByqUQl-j-jeuz3ZlDifv-AybbaE4XuWyMLS26CYwepfIjCDmuhu6GgTlul94N2mk1ON9ZP99YruRaC4R3HqPmFJWZAzBzAGaOqh8N70VtelTiP5kajXw
Cites_doi 10.1016/B978-0-12-324245-7.50005-8
10.1016/0022-0000(91)90024-Y
10.1112/plms/s2-42.1.230
10.1007/s000370050013
10.2307/2269326
10.1007/978-94-017-3477-6
10.12732/ijpam.v94i1.9
10.1145/800157.805047
10.1090/coll/038
10.5402/2012/321372
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.22363/2312-8143-2022-23-2-108-116
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList
CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2312-8151
EndPage 116
ExternalDocumentID oai_doaj_org_article_8b46dbe34b7946d991c2a5dc98c869cd
10_22363_2312_8143_2022_23_2_108_116
GroupedDBID AAYXX
ALMA_UNASSIGNED_HOLDINGS
CITATION
GROUPED_DOAJ
ID FETCH-LOGICAL-c1736-1d36e86f40a9ed6f91d67bc28cf5151b8fe62140f84ec4472ee1e21ec4bf04533
IEDL.DBID DOA
ISSN 2312-8143
IngestDate Fri Oct 03 12:52:43 EDT 2025
Wed Oct 29 21:16:17 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
License https://creativecommons.org/licenses/by-nc/4.0/legalcode
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c1736-1d36e86f40a9ed6f91d67bc28cf5151b8fe62140f84ec4472ee1e21ec4bf04533
ORCID 0000-0003-0116-5889
OpenAccessLink https://doaj.org/article/8b46dbe34b7946d991c2a5dc98c869cd
PageCount 9
ParticipantIDs doaj_primary_oai_doaj_org_article_8b46dbe34b7946d991c2a5dc98c869cd
crossref_primary_10_22363_2312_8143_2022_23_2_108_116
PublicationCentury 2000
PublicationDate 2022-08-21
PublicationDateYYYYMMDD 2022-08-21
PublicationDate_xml – month: 08
  year: 2022
  text: 2022-08-21
  day: 21
PublicationDecade 2020
PublicationTitle Vestnik Rossiĭskogo universiteta druzhby narodov. Serii͡a︡ Inzhenernye issledovanii͡a
PublicationYear 2022
Publisher Peoples’ Friendship University of Russia (RUDN University)
Publisher_xml – name: Peoples’ Friendship University of Russia (RUDN University)
References ref13
ref12
ref15
ref14
ref11
ref10
ref2
ref1
ref17
ref16
ref19
ref18
ref8
ref7
ref9
ref4
ref3
ref6
ref5
References_xml – ident: ref13
– ident: ref2
– ident: ref3
– ident: ref6
– ident: ref18
  doi: 10.1016/B978-0-12-324245-7.50005-8
– ident: ref5
  doi: 10.1016/0022-0000(91)90024-Y
– ident: ref11
  doi: 10.1112/plms/s2-42.1.230
– ident: ref4
  doi: 10.1007/s000370050013
– ident: ref10
  doi: 10.2307/2269326
– ident: ref12
  doi: 10.1007/978-94-017-3477-6
– ident: ref8
  doi: 10.12732/ijpam.v94i1.9
– ident: ref1
  doi: 10.1145/800157.805047
– ident: ref9
– ident: ref15
  doi: 10.1090/coll/038
– ident: ref19
– ident: ref7
  doi: 10.5402/2012/321372
– ident: ref16
– ident: ref17
– ident: ref14
SSID ssj0002914000
Score 2.1919882
Snippet 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...
SourceID doaj
crossref
SourceType Open Website
Index Database
StartPage 108
Title Necessary and sufficient conditions for dividing the structure of algorithms into non-intersecting sets: polynomial and enumeration algorithms
URI https://doaj.org/article/8b46dbe34b7946d991c2a5dc98c869cd
Volume 23
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2312-8151
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002914000
  issn: 2312-8143
  databaseCode: DOA
  dateStart: 20080101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Na9wwEBUllNIcQtMmZNsm6LBXs6sPy1JuTeiS05JDCnsz-mwXEjvYu4H9E_nNnZE3wbdccrItkC00j5k3ZvSGkKkpHZPWh4IHXxUS6FuBmiQF985ogS0hQ8rNJqrlUq9W5nbU6gtrwgZ54GHjZtpJFVwU0qEUegA647ktgzfaa2V8QO87r8womUIfzA0kDvn8CfAXjv-5xCcyxbpnLpSYvQ4CSCAZ43AFfwTpFLY9H8WnkYx_jjeLL-RoTxTpr2GBx-RDbL6Sw5F84DfyvIxY5G-7HbVNoP02y0FAFKGQ5IahFosCKaX5zBVMocD26KAYu-0ibRO193_bbr3599DTdbNpadM2BSpIdD06QpjRx01_SR_b-x2eX4YF4ZewfD4O0Bm94YT8Wfy-u74p9v0VCs8qoQoWhIpaJTm3JgaVDAuqcp5rn4DlMKdTVBz2MWkZvQQ7xsgiZ3DvEjBBIU7JASwrnhEKgdCyUMpktZB67qwqbaWF9VGwMogwIeXLrtaPg4xGDelHtkaN1qjRGjVaAx5rjrqlkJyoCblCE7zOQTHsPAAQqfcQqd-CyPf3eMkP8jljBVDC2U9yALaK5-Sjf9qs--4io-8_oVTdjg
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Necessary+and+sufficient+conditions+for+dividing+the+structure+of+algorithms+into+non-intersecting+sets%3A+polynomial+and+enumeration+algorithms&rft.jtitle=Vestnik+Rossi%C4%ADskogo+universiteta+druzhby+narodov.+Serii%CD%A1a%EF%B8%A1+Inzhenernye+issledovanii%CD%A1a&rft.au=Malinina%2C+Natalia+L.&rft.date=2022-08-21&rft.issn=2312-8143&rft.eissn=2312-8151&rft.volume=23&rft.issue=2&rft.spage=108&rft.epage=116&rft_id=info:doi/10.22363%2F2312-8143-2022-23-2-108-116&rft.externalDBID=n%2Fa&rft.externalDocID=10_22363_2312_8143_2022_23_2_108_116
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2312-8143&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2312-8143&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2312-8143&client=summon