SIGBOVIK 2007: Generalized Super Mario Bros. is NP-Complete

档案导读

Tom Murphy's satirical SIGBOVIK 2007 presentation, delivered under a pseudonym, proving that generalized Super Mario Bros. is NP-complete. It is a short, deadpan take on a complexity theory result.