INTERNATIONAL JOURNAL OF INFORMATION AND COMMUNICATION TECHNOLOGIES

ABOUT THE MILLENNIUM PROBLEM FOR P & NP CLASSES

Authors

  • Б.К. Синчев МУИТ https://orcid.org/0000-0001-8557-8458
  • О. Danchenko доктор технических наук, профессор, ЧЕРКАССКИЙ ГОСУДАРСТВЕННЫЙ ТЕХНОЛОГИЧЕСКИЙ УНИВЕРСИТЕТ (Украина)

DOI:

https://doi.org/10.54309/IJICT.2023.14.2.009

Keywords:

Keywords: classes P, NP, NP-complete, set, subset, power, time, space

Abstract

Annotation. The problem of equality of classes P and NP is reduced to solving the problem of the sum of subsets. The linear (or quadratic) solvability of the problem, which belongs to the NP-complete class, is proved. Thus, the linear solvability and completeness of the subset sum problem confirm the equality of classes P and NP.

Downloads

Download data is not yet available.

Downloads

Published

2023-06-15

How to Cite

Sinchev, B., & О. Danchenko. (2023). ABOUT THE MILLENNIUM PROBLEM FOR P & NP CLASSES. INTERNATIONAL JOURNAL OF INFORMATION AND COMMUNICATION TECHNOLOGIES, 4(2), 94–101. https://doi.org/10.54309/IJICT.2023.14.2.009

Issue

Vol. 4 No. 2 (2023): INTERNATIONAL JOURNAL OF INFORMATION AND COMMUNICATION TECHNOLOGIES

Section

ИНФОРМАЦИОННЫЕ ТЕХНОЛОГИИ

License

Copyright (c) 2023 INTERNATIONAL JOURNAL OF INFORMATION AND COMMUNICATION TECHNOLOGIES

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

https://creativecommons.org/licenses/by-nc-nd/3.0/deed.en