Topcount topcount
P versus NP problem
#general

P versus NP problem

Statement: “If the solution to a problem can be quickly verified by a computer, can the computer also solve that problem quickly?” Most likely to be solved soon because it’s a feast for computer lovers .The answer is simple yes or with a proper algorithmic proof. In fact The problem is so popular that in 2012, a movie named “traveling salesman” was made on the concept of P=NP problems, where four mathematicians solved the problem for United States Department of Defense.  

0 aggregate score 1 list appearances
Total Votes
0
Lists
1
Best Rank
#1
Avg Rank
#1

Featured in these lists

Compare with others in General

Discussion (0)

Sign in to join the discussion.
No comments yet. Be the first.