How the world will be if P = NP?

  • Posted 5 hours ago by fouadelkh
  • 1 points
The P versus NP problem is of theoretical and practical importance in computer science. The question is whether finding a solution to a problem is easy as checking a proposed solution for correctness. If any NP complete problem is in P, then P and NP are the same class of problems.

I found a polynomial time algorithm for the traveling salesman problem (TSP) with distances a and b. This special case of the TSP is NP complete. The algorithm finds an optimal tour in time at most proportional to n^2 and it's much more efficient for finding a tour of a graph (Hamilton cycle). I post on my resolution of P vs NP at https://www.pvsnp.blog

Good and bad consequences will result if the equality is true. What do you think is the most positive about P = NP?

2 comments

    Loading..
    Loading..