SIGBOVIK 2007: Generalized Super Mario Bros. is NP-Complete
suckerpinch在 YouTube 播放 ↗
档案导读
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.
档案英文原文 · 来自 HackerTube 开放档案，暂未收录字幕分析。