This is a platform dedicated to tackling some of the most profound and challenging problems in computer science. Here, you can learn about, discuss, and even attempt to solve problems that have puzzled researchers for decades.
In computer science, "NP" stands for "nondeterministic polynomial time". It represents a class of problems for which a given solution can be verified quickly (in polynomial time). However, finding the solution itself may be incredibly difficult. The "P versus NP problem," one of the seven Millennium Prize Problems, asks whether every problem whose solution can be quickly verified can also be quickly solved.
This platform hosts a collection of NP-hard problems. These are problems that are at least as hard as the hardest problems in NP. They are famous for their computational complexity, and no efficient (polynomial-time) algorithm is known for solving them.
The platform currently features the following NP-hard problems:
Unlike some variations of these classical NP problems that focus on finding a single correct solution (e.g., solving a Sudoku or coloring a graph with a given number of colors), this platform emphasizes optimization. Your goal is not just to find a solution, but to continuosly improve one.
Think you have a great approach? The top 10 solutions for each problem are showcased in a global leaderboard!
The P versus NP problem is a major unsolved problem in theoretical computer science. It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute, each of which carries a $1,000,000 prize for the first correct solution. Informally, it asks whether every problem whose solution can be quickly verified can also be quickly solved.
What do you think? Cast your vote!