On the Theory of NP-Complete Problems
Journal Title: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY - Year 2013, Vol 11, Issue 4
Abstract
It is shown that the theory of NP -Ñomplete problems can't be used for the analysis of optimizing tasks.
Authors and Affiliations
S. V. Listrovoy
Keywords
Related Articles
- EP ID EP650321
- DOI 10.24297/ijct.v11i4.3132
- Views 81
- Downloads 0
A Comparative Analysis of Feed-Forward and Generalized Regression Neural Networks for Face Recognition Using Principal Component Analysis
In this paper we give a comparative analysis of performance of feed forward neural network and generalized regression neural network based face recognition. We use different inner epoch for different input pattern accor...
BITS-Tree -- An Efficient Data Structure for Segment Storage and Query Processing
In this paper, a new and novel data structure is proposed to dynamically insert and delete segments. Unlike the standard segment trees, the proposed data structure permits insertion of a segment with interval range beyon...
The ICM Approach as a Way for Improving Leaning Science Subjects in High Schools in Tanzania
This paper focuses on the design and trial of the Integrated Chemistry Modules (ICM). The objective was to design the approach, thereafter try it out. Observations show that teachers and students appreciated the approach...
A Robust High Performance Face Recognition using Decorrelation of Local Features by Discrete Cosine Transforms
This paper proposes a novel method of face recognition using de-correlation of local features using Discrete Cosine Transforms (DCT). The impulse for the proposed idea is with the fact that histograms DC constituent of l...
Mapping between XML and RDF via DTD
XML has gained massive popularity for representation of data in last decades. Both HTML and XML are used as primary data formats since the existence of World Wide Web. As the amount of data is growing, need has emerged t...