Whether its using multiplication for division or plugging the response in for a variable, math instructors tell you to inspect your work using your answer in every school math class.But lets say you can verify a service easily, is it simply as easy to fix for that solution?This is the P versus NP problem, a Millenium Prize Problem where the solver will receive a million dollars if valid evidence is provided.What is P versus NP?In computer science, the performance of algorithms is really important. Lets state the intricacy of input is some number n, a polynomial time algorithm will be able to fix a problem in nk steps.Essentially, P vs NP is asking the question: Are problems that can have options confirmed in polynomial time, likewise have their answers fixed in polynomial time?NP- CompletenessAn Euler Diagram showing the cases for NP-Completeness for P ≠ NP and P = NP. Scientists would then focus less on a general service to all NP-complete problems which would not actually alter much.ClosingP vs NP is a crucial unsolved issue in computer science that could have drastic effects.
