4
P versus NP problem
Wikimedia
P versus NP problem illustration
The P versus NP problem deals with the classification of computational problems. It asks whether every problem for which a solution can be verified in polynomial time can also be solved in polynomial time. In other words, it investigates the relationship between problems that are easy to verify and those that are easy to solve.
More Science
Healthy Tech Habits For A Better, More Creative Life
Some healthy tech habits can be useful for a better, more creative existence.
The 6 Biggest AI Fails... So Far
Nobody's perfect - especially when it comes to algorithms.
Why Lions are Secret Wimps?
From false PR to low-energy, in this article, we expose the things lions don't want you to know!.
Slightly Embarassing Signs of High Intelligence
Being intelligent isn't all smiles and giggles.
How devastating a nuclear blast can be in a major city?
A fictional simulation of a nuclear blast illustrates the danger of a nuclear blast.