User:Amiya Singh

=== The world we are living in today is the world of computers and science. Due to the revolution in the computer field in the 20th century, there has been a lot of speed in the receipt of information and its processing, due to this revolution computerization of every field has become possible. A computer is a calculator, the calculator solves the biggest problem of mathematics within a few seconds, but the calculator also has a limitation, the calculator cannot solve every mathematical problem like geometric problem etc. Along with the geometric problem, there are many other problems that we need to create a different type of algorithm to solve. The problem which we can solve in polynomial time is called p type problem and a problem whose solution we think is easy but when it comes to solving it, we do not know how to solve it. How much time will it take or in how many steps it will be solved. We call this type of problem np type problem. There are some problems of mathematics which were once considered to be problems of np type but due to technology revolution today that problem is solved in polynomial time. Therefore, it would not be wrong to say that the problem of np squares must have been a problem of np squares at one time or another. Presently np is called set and p is called subset of np. There is another subset in the p€np np class which we call the np complete problem. === NP Hard problems  are the  problem  is  NP  fall within Class Those  problems  are  NP Complete  say Problem. np We can understand the complete problem with an example - what can you tell that there is no such problem in the computer?

There is an algorithm that tells the number of planets in our galaxy. There will be only one answer for you and all of us.
Can you tell me all the ways? We and you can tell at most 2factorial methods (like 21 12) all methods of 3factorial, all methods of 4factorial and all methods of 10 factorial through computer or your brain but it is not possible to tell all types of 80factorial at present Because till date no such algorithm has been made which does this. We call the above problem as the np complete problem. If np solves one of the complete problems then p = np it will be proved and then all the problems will have only one set p.