On the Theory of NP-Complete Problems

Authors

  • S.V. Listrovoy Professor of Ukrainian State Academy of Railway Transport, Kharkov.

DOI:

https://doi.org/10.24297/ijct.v11i4.3132

Keywords:

NP-complete problem, polynomial reducibility.

Abstract

It is shown that the theory of NP -Ñomplete problems can't be used for the analysis of optimizing tasks.

Downloads

Download data is not yet available.

Author Biography

S.V. Listrovoy, Professor of Ukrainian State Academy of Railway Transport, Kharkov.

Doctor of technical sciences

Downloads

Published

2013-10-10

How to Cite

Listrovoy, S. (2013). On the Theory of NP-Complete Problems. INTERNATIONAL JOURNAL OF COMPUTERS &Amp; TECHNOLOGY, 11(4), 2481–2483. https://doi.org/10.24297/ijct.v11i4.3132

Issue

Vol. 11 No. 4 (2013)

Section

Research Articles
Crossref
Scopus
Google Scholar
Europe PMC