When computer scientists hang out at cocktail parties, they're apt to chat, among other things, about the single most important unsolved problem in computer science: the question, Does P = NP?
Studying the epic journey of the iconic jumping plumber can lead to new insights in theoretical computer science—and may help researchers understand the tractability of problems in other areas.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results