What is the theory of computational complexity?
The theory of computing complexity is the area of mathematics and computer science, which concerns sources necessary to solve problems in the computer system. There are a number of techniques to determine the requirements for the source of the problem. Some problems may not be feasible for existing computer systems due to their resources requirements. Scientists classify problems with difficulty and can divide calculations into polynomial (p) versus non -chermistic polynomial (NP). The computer system may have restrictions that make it impossible to solve the problem of functionally impossible because it does not have available resources. As computer technology improves, a previously unsolvable problem could become a solvable problem with the help of new technologies and research in the field of computing complexity. The dissolution of the problem is not necessarily determined by its complexity, but naalgorithms used to solve it.
In the theory of computing complexity, the problem P is a problem that can be solved in a polynomial time with a direct algorithm. It could still require a significant sourceE, but it's both balanced and controllable using a computer. Such problems can be considered as rapidly respected if the computer has available sources for processing the necessary calculations.
ProblemsNP are more complex. It is not possible to use one algorithm and it may be necessary to use more advanced options, such as parallel Turing machines that can explore several options. The problem could be solvable in this way, but will require significantly more resources. Such problems can be easier for human operators who are capable of advanced logical thinking, because the turn of the twist is often a logic rather than mere computing difficulties. The Travel Salesman Problem, which aims to find the most effective way between a number of cities along the route, is a classic example of the NP problem in the theory of computing complexity.
Classification of P Versus NP Problems through the Theory of Computer CompletionIt can be a complicated task and problems can move back and forth throughout the abyss. Small set of computational problems are neatly suitable for any category and sometimes not classified as one to reflect it. Finally, it could be possible to develop an algorithm to solve the NP problem and in some cases it could apply to other problems that have a similar structure. In others, however, this may be specific to the problem. The process of exploring such programs and the development of approaches to their solution is an important area of mathematics and computer science, which contributes to the development of advanced high -performance computer systems.