抽象的な

P vs. NP Solution

Dominic Alexander Cooper

The P vs. NP problem is to find the answer to a search problem without searching. To find the needle in a hay stack without searching; which can be achieved with the use of a powerful magnet. Therefore the P vs. NP solution is to define the details of the computer equivalent “magnet,” for its use in solving NP complete, NP and P problems. This article provides a general formula which can be adapted to reduce the amount of time spent in solving each type of problem (NP complete problems, NP problems and P problems).