Article
Maths in a minute: The SAT problem
Find out how binary logic leads to a really hard problem that can embody lots of other really hard problems.
Find out how binary logic leads to a really hard problem that can embody lots of other really hard problems.
You may have heard of a class of problems called NP. But have you heard of coNP? Find out what it is as what it means for P versus NP.
There are problems that are easy to solve in theory, but impossible to solve in practice. Intrigued? Then join us on a journey through the world of complexity, all the way to the famous P versus NP conjecture.
It's one of the most notorious problems around and takes you straight to the frontiers of maths research. Find out more in this introduction!