The real problem through a selection making an algorithm that minimizes the computational complexity

Abstract

Computational complexity issues are gaining increasing attention as information search, retrieval and extraction techniques and methodologies mature. This paper presents the theoretical approach of computational complexity reduction which supports information related operations in an effective and efficient manner. Three-step approach to design paradigm will have different costs (time), will consume different amount of resource (space) and will have some inherent risk or uncertainty. To capture these aspects, we need economic models of software that take into account costs, space, uncertainty and schedule implications. To address this need for economic decision making, we have proposed a method of economic modeling of information-related operations centered on an analysis of their architecture. Although we consider that the computation problem belongs to the class of np-complete. In this paper, our objective is to solve the real problem by an decision making algorithm that minimizes the computational complexity.