Tag Archives: Kalamazoo

P vs NP: What’s the problem?

As promised (better late than never), I’m going to begin explaining the (in)famous P vs NP question (see the previous post for a bit more context). As a start, here’s a super-concise, 30,000-foot version of the question: Are there problems … Continue reading

Posted in computation, open problems | Tagged , , , , | 9 Comments