- Home
- Tags
- Random Facts
- Latest Facts

The P versus NP problem is a most important unsolved problem in computer science. It simply means If the solution to a problem can be quickly verified by a computer, can the computer also solve that problem quickly?

- In 1971 by Stephen Cook, introduced this problem in his seminar paper "The complexity of theorem proving procedures"
- Director Timothy Lanzone's film Travelling Salesman, is the story of four mathematicians hired by the US government to solve the P vs. NP problem.
- P and NP is studied in computational complexity theory (set of problems). The most common resources are time and memory(space).
- It is one of the seven in Millennium Prize Problems announced by the Clay Mathematics Institute.

We would often think that there are more number of natural numbers than the even numbers because nat...

If this is proved to be correct, everything we have learned in our life so far in Mathematics will g...

This will be one of the world most unexplained phenomena you would ever see. The miracle of numbers ...

Percy Spencer, an American Engineer accidentally discovered Microwave Oven while working on Raytheon...

The number of possibility chess moves after the white move's is 20 (ie 4 knight moves and 16 moves o...

A Beautiful Mind is the movie based on the life of john nash, who is said to be Nobel Laureate in e...

Your twin sibling will get more youthful than you when he returns from the space travel. If your twi...

Grigori Yakovlevich Perelman is a Russian mathematician, who made a history in Riemannian geometry a...

Daily Maths Topic Today - is p equal to np.