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

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!.

What Do Ancient Egyptian Mummies Sound Like?
Ever wondered what ancient Egyptian mummies sound like? Well, you might have found the answer today.

Do Himalayan Salt Lamps Actually Do Anything?
Salt lamps come with some pretty big claims, but do they deliver?.

Slightly Embarassing Signs of High Intelligence
Being intelligent isn't all smiles and giggles.

Healthy Tech Habits For A Better, More Creative Life
Some healthy tech habits can be useful for a better, more creative existence.