Review on Intractability

Abstract

In real life, the problems may be of infinite dimensions. Design of ingenious information structure, for minimizing complexity and redundancy of the problem space are versatile. This is unique in the sense: given an arbitrary ’n’ node graph the problem becomes countable infinite and in some cases it is uncountable infinite. Problems which can be mapped as graphs are normally simple in nature but we remember the adage “Simple things are mighty things”. What we mean that normally for example it is a practice to bring undue mathematics to make things complex but although the graph algorithms are of exponential complexity for large dimension.