Share Your Research, Maximize Your Social Impacts
On the Theory of NP-Complete Problems
Journal: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY (Vol.11, No. 4)Publication Date: 2013-12-08
Authors : S.V. Listrovoy;
Page : 2481-2483
Keywords : NP-complete problem; polynomial reducibility.;
Source : Download Find it from : Google Scholar
Abstract
It is shown that the theory of NP -сomplete problems can't be used for the analysis of optimizing tasks.
Other Latest Articles
- A Survey on SmartPhone Honeypot
- Enhancing the Security of the GPT Cryptosystem Against Attacks
- Dynamic Fault Tolerance in Desktop Grids Based On Reliability
- TheWorkQueue with Dynamic Replication-FaultTolerant Scheduler in Desktop Grid Environment
- Development of HTTP Server for Remote Data Monitoring and Recording System
Last modified: 2016-06-29 18:42:40