ConceptTheory & Algos
Tetris in NP
The decision problem of whether one can survive a game of Tetris is in NP because a winning sequence of moves can be guessed and checked in polynomial time.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.