Tag: P = NP

What if P = NP?
Update (5 March): read a better version here. I admit I now going slightly out of my depth, but I will try to explain what this is about and why it is interesting. It is known that computers can solve some problems in what is called “polynomial time“: that is to say a finite time […]